Adaptive query routing in a replicated database environment

ABSTRACT

Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/589,160, filed on May 8, 2017, which is hereby incorporated herein byreference.

FIELD

The present disclosure generally relates to the replication ofinformation. Particular implementations relate to routing of preparedstatements, such as for queries, to nodes in a replicated databaseenvironment.

BACKGROUND

Database performance can be enhanced by creating a replica of a sourcetable. For example, the replicated table may be hosted on a differentcomputing system than the source table, with the source and replicahosts having different processors. Having replicas available to servicedatabase read requests can help balance computing loads among multipleprocessors, improving system performance. In some cases, replicas canalso be used for “high-availability data” purposes, such as when thereplica is able to take over one or more functions of the source tableif the source table becomes unavailable.

Challenges in replicated systems include maintaining consistency betweenthe source table and the replica table. Replication can also result inreduced system performance if the overhead associated with replicationis too high. For example, in typical synchronous replication protocols,the replica is updated within the same transaction boundary as thesource. However, this can result in delayed transaction visibility atboth the source and replica hosts, as synchronous replication typicallyinvolves multiple communications between the computing system hostingthe source table and the computing system hosting the replica table. Insome cases, performance can be improved by asynchronously replicatingchanges to the replica table.

When replicated database systems are used to handle a larger volume ofdatabase requests, such as read requests, issues can arise if a replicato which a request is directed is not available to serve the request.For instance, if a read request is routed (or indicated for routing) toa replica node that has crashed or is otherwise offline, the readrequest may return an error to the database client. In at least somecases, the read request may not be processable until the replica nodecomes back online or specific corrective action is taken, which may beoutside of the technical expertise of a user of the database system whoissued the read request, and, in any event, may significantly delayprocessing of the read request. In other cases, replication may bedeactivated, with all database operations being routed to the sourcedatabase system, which can greatly degrade the performance of thedatabase system. Thus, room for improvement remains in replicated,distributed database systems.

SUMMARY

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter.

Techniques and solutions are described for facilitating preparedstatement execution in a replicated database environment, such forexecuting queries. The database environment includes at least one sourcenode, at least one replica node, and a database client.

In one aspect, a database system node determines that the availabilitystatus of a replica node has changed. The database system node receivesa prepared statement, such as for a query, from a database client. Theprepared statement specifies one or more nodes usable to execute theprepared statement. The prepared statement is updated. The updatingincludes adding a node to the one or more nodes of the preparedstatement, such as if the replica node became available, or removing atleast one of the one or more nodes from the prepared statement, such asif the replica node became unavailable.

In another aspect, the database client sends a request to a databasesystem node to prepare a statement. The database client receives aprepared statement from the database system node. The prepared statementspecifies at least one database system node on which the preparedstatement is executable. The prepared statement is sent by the databaseclient to the at least one database system node. The database clientreceives an updated prepared statement. The updated prepared statementspecifies one or more nodes on which the updated prepared statement isexecutable. The one or more nodes on which the updated preparedstatement is executable include a node that was not specified in theprepared statement, or omits the at least one database system nodespecified in the prepared statement.

In yet another aspect, a node of a plurality of database system nodes ina replicated database environment determines that an availability statusof a replica node of the replicated database environment has changed.The availability status change is recorded in a data store that includesavailability status for nodes of the replicated database system. Ametadata identifier is incremented at the node. A prepared statement isreceived by the node from a database client. The prepared statement isassociated with a version timestamp. The version timestamp is comparedwith the incremented metadata identifier. It is determined that theprepared statement should be updated. The prepared statement is updatedusing the availability status information of the data store. The updatedprepared statement is sent to the database client.

As described herein, a variety of other features and advantages can beincorporated into the technologies as desired.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an environment supporting replication using DMLstatements and write log shipping.

FIG. 2 is a diagram depicting a database environment for performingreplication of database tables using DML statements and write logshipping.

FIG. 3 is a diagram depicting a database environment for performingreplication of database tables from a source node to replica nodes.

FIG. 4 is a diagram depicting an architecture of a transaction contextproviding version space management that may be used in at least certainimplementations of the present disclosure.

FIG. 5A is a diagram illustrating an unreplicated database system.

FIG. 5B is a diagram depicting how replicating database tables from asource node to replica nodes can provide for load balancing in adatabase system.

FIG. 6A is a diagram depicting how inefficient cross-node joinoperations may be executed in a distributed database system withouttable replication.

FIG. 6B is a diagram illustrating how replication can be used in adistributed database system to avoid cross-node join operations.

FIG. 7 is a diagram depicting a synchronous database replicationprotocol.

FIG. 8 is a diagram depicting an asynchronous database replicationprotocol.

FIG. 9 is a diagram depicting a partially, or “optimistic,” synchronousdatabase replication protocol.

FIG. 10 is a block architectural diagram illustrating an examplereplicated database environment in which at least certain disclosedinnovations may be implemented.

FIG. 11A is diagram schematically depicting different strategies forprepared statement/query routing when a replica database system nodebecomes fully or partially unavailable.

FIG. 11B is diagram schematically depicting prepared statement/queryrouting strategies when a portion of tables replicated at a replicadatabase system node are unavailable, while another portion remainavailable.

FIG. 12 is a diagram of an example routing protocol for routing preparedstatements/queries to a source node when a replica node becomesunavailable.

FIG. 13 is a diagram of an example prepared statement/query routingprotocol for routing queries/prepared statements to available databasesystem nodes when a replica node becomes available.

FIG. 14 is a diagram of an example prepared statement/query routingprotocol for routing queries/ prepared statements to available databasesystem nodes when the availability status of a replica node changes.

FIG. 15 is a diagram of an example query/prepared statement routingprotocol for routing queries/prepared statements to available databasesystem nodes when the availability status of particular tablesreplicated at a particular replica node changes.

FIG. 16 is a diagram of example operations during a commit process thatoccurs concurrently with a change in the availability status of areplica node.

FIG. 17 is a flowchart of example operations, at a database system node,relating to query/prepared statement routing when a replica node of thedatabase system experiences a change in availability status.

FIG. 18 is a flowchart of example operations at a database clientrelating to requesting the compiling of a prepared statement, andexecution of a prepared statement.

FIG. 19 is a flowchart of example operations, at a database system node,relating to query/prepared statement routing when a replica node of thedatabase system experiences a change in availability status.

FIG. 20 is diagram depicting a database environment for synchronizingdatabase tables maintained at a source system with copies of thedatabase tables maintained at a replica system.

FIG. 21A is a flowchart of an example method involving a source node forsynchronizing database tables maintained at a source system with copiesof the database tables maintained at a replica node.

FIG. 21B is a flowchart of an example method involving a replica nodefor synchronizing database tables maintained at a source system withcopies of the database tables maintained at a replica node.

FIG. 22 is a diagram of a replica node illustrating how asynchronization timestamp may be used to determine whether writeoperations are replayed at the replica node.

FIG. 23 is a diagram of an example computing system in which somedescribed embodiments can be implemented.

FIG. 24 is an example cloud computing environment that can be used inconjunction with the technologies described herein.

DETAILED DESCRIPTION EXAMPLE 1 Overview

Database performance can be enhanced by creating a replica of a sourcetable. For example, the replicated table may be hosted on a differentcomputing system than the source table, with the source and replicahosts having different processors. Having replicas available to servicedatabase read requests can help balance computing loads among multipleprocessors, improving system performance. In some cases, replicas canalso be used for “high-availability data” purposes, such as when thereplica is able to take over one or more functions of the source tableif the source table becomes unavailable.

Challenges in replicated systems include maintaining consistency betweenthe source table and the replica table. Replication can also result inreduced system performance if the overhead associated with replicationis too high. For example, in typical synchronous replication protocols,the replica is updated within the same transaction boundary as thesource. However, this can result in delayed transaction visibility atboth the source and replica hosts, as synchronous replication typicallyinvolves multiple communications between the computing system hostingthe source table and the computing system hosting the replica table. Insome cases, performance can be improved by asynchronously replicatingchanges to the replica table.

When replicated database systems are used to handle a larger volume ofdatabase requests, such as read requests, issues can arise if a replicato which a request is directed is not available to serve the request.For instance, if a read request is routed (or indicated for routing) toa replica node that has crashed or is otherwise offline, the readrequest may return an error to the database client. In at least somecases, the read request may not be processable until the replica nodecomes back online or specific corrective action is taken, which may beoutside of the technical expertise of a user of the database system whoissued the read request, and, in any event, may significantly delayprocessing of the read request. In other cases, replication may bedeactivated, with all database operations being routed to the sourcedatabase system, which can greatly degrade the performance of thedatabase system. Thus, room for improvement remains in replicated,distributed database systems.

The present disclosure provides for rerouting of read requests, such asqueries, directed to a replica database node that is inactive, or havingdata (e.g., tables or records) that are otherwise unavailable at thereplica node. The read requests can be represented by a preparedstatement, which can be associated, for example, with an execution planstored on a database node. A replica node that is inactive can be areplica node that cannot be reached by a database client, such asbecause the replica node has crashed or is offline. In some cases, areplica node can be considered inactive even if it has not crashed, andis not offline, such as if there is a network error that is preventingthe client, or a source node, from communicating with the replica node,or if the replica node is out of memory. In some cases, only a portionof data at a replica may be unavailable, such as if a process having alock on certain tables or records becomes deadlocked, but otherprocesses, involving other tables or records, are not deadlocked, as thereplica node is otherwise available and functional.

In some cases, when a replica node is determined to be unavailable,completely, or, in some cases, for particular data, rather thanreturning an error to the database client, a read request can be routedto the source node. In other cases, when a replica node is determined tobe unavailable, in whole or part, the read request can be routed to thesource node or any operational replica node having the replicated data.Routing the read request to any available node can help preserve thebenefits of the replicated database environment, even if not all of thereplica nodes are fully available. In either case, when a replica nodebecomes available again, read requests can once again be routed to thereplica node.

The disclosed innovations can provide a number of advantages. Inparticular, the disclosed innovations can allow read requests directedto non-operational replica nodes to be executed, rather than simplyreturning an error. Redirecting read requests to any available node canhelp preserve the benefits of replication even if not all replica nodesare available. The database system can automatically resume normaloperation when a replica node that was not fully operational becomesfully operational. Thus, the disclosed innovations can provide databasesystems that are less error-prone, provide improved throughput of readrequests, and which are easier to maintain.

EXAMPLE 2 Distributed and/or Replicated Database Environment

Database performance can be enhanced by creating a replica of a sourcetable. For example, the replicated table may be hosted on a differentcomputing system than the source table, with the source and replicahosts having different processors. Having replicas available to servicedatabase read requests can help balance computing loads among multipleprocessors, improving system performance. In some cases, replicas canalso be used for “high-availability data” purposes, such as when thereplica is able to take over one or more functions of the source tableif the source table becomes unavailable.

The following description is directed to techniques and solutions foraccessing data in a replicated database environment. Although thedisclosed innovations are not limited to any particular data replicationtechnique, efficient replication of database data can be performed usingdata manipulation (DML) statements and write log shipping. As usedherein, a DML statement refers to any statement, command, message, orother instruction that specifies any manipulation (e.g., insert, update,delete, select) of data. In some implementations, DML statements areexecuted (e.g., at a first database system) and write logs are createdreflecting the DML statements and transaction commit operations. In oneexample, a separate write log entry is created for each DML statement ortransaction commit operation. In a specific example, a write log entrycan include a DML statement and associated parameters and/or values(e.g., parameters and/or values that may be needed when the DMLstatement is executed at another database system). The write logsentries can be inserted into a write log queue and sent to one or moreother database systems for execution. In this way, database data can bereplicated between a first database system (e.g., a source host or asource system distributed among multiple source nodes) and one or moreother database systems (e.g., a replica system having a replica host orbeing replicated among multiple replica nodes).

As used herein, a source system refers to a database system (e.g., oneor more computing devices implementing a database environment) fromwhich database information (e.g., one or more database tables, an entiredatabase, or other selection of database information) is replicated toother systems. The term database table indicates any portion of adatabase, however organized. A host refers to a computing system havinga processor and memory. In some cases, a source system can includemultiple hosts, typically referred to as nodes. However, unless thecontext clearly indicates otherwise, a node can refer to the host in asingle host system, or one of a plurality of hosts in a system. A master(or coordinator) node refers to a source node that manages informationregarding the master node and one or more slave (or worker) nodes. Aslave node refers to a source node that is installed on a different hostthan the master source node.

Tables (e.g., database tables) can be replicated to multiple nodes(e.g., database nodes) in a scale-out system. This feature can providescalable search or query throughput by leveraging multiple cores inmultiple nodes beyond the limitation of a single machine. It can alsoreduce network traffic for joins performed on multiple tables, whenthose tables are replicated on multiple nodes, by providing morelocalized access. In a specific example, data replication can improveperformance of a database system for both online analytical processing(OLAP) queries and operations and online transaction processing (OLTP)transactions and queries.

A performance penalty can occur when DML statements are replicated in asynchronous manner (e.g., when a DML statement is executed on a sourcesystem and a replica system within the same transaction boundary, whereexecution on all nodes must complete before the transaction iscommitted). In some cases, the penalty can be reduced, which achieves alarger degree of scale-out benefits, through asynchronous replication.In some implementations of asynchronous replication, a transaction iscommitted when the DML statements in the transaction are committed atthe source system, and the changes are propagated to the replica systemoutside the transaction boundary. The performance penalty associatedwith synchronous table replication can be reduced by modifying thetypical synchronous replication protocol, such by reducing the number ofsynchronous operations between the source system and the replica system(e.g., “optimistic” synchronous table replication).

As used herein, a replica system refers to a database system thatreplicates database information (e.g., replicates one or more databasetables, an entire database, or other selection of database information)from a source system, such as a single source host or a source systemdistributed among multiple source nodes. In some examples, the replicasystem may include a single replica host. In other examples, the replicasystem includes a plurality of replica nodes, which may store multiplecopies of database tables maintained at the source system, have sourcedatabase tables distributed across a plurality of replica nodes, orcombinations thereof. In yet further examples, a single table may bedistributed among multiple source nodes and/or may be distributed amongmultiple replica nodes.

The data at different database nodes in a distributed database system(such as a database system that includes more than one replica node,more than one source node, or more than one source node and more thanone replica node) can be a database table that is partitioned (that is,divided, split) between database nodes. The database table can bepartitioned between rows (different rows in different partitions) and/orbetween columns (different columns in different partitions). Thedatabase nodes of a distributed database system can contain one or morepartitions (parts) of partitioned tables. Alternatively, the partitioneddata is organized in some other way (e.g., a graph database, a documentstore, or a key-value store). Unless indicated otherwise, a databasetable can refer to a partition of a database table. In further examples,the table is not partitioned.

When partitioned, a database table may be split among multiple sourcenodes and replicated to multiple replica nodes. In some cases, thepartitioning is the same between the source nodes and the replica nodes,while in other cases it is different. In other implementations, thetable may be partitioned at the source nodes, but replicated to asingle, non-partitioned, replica table at a single replica node. In yetfurther examples, a table that is not partitioned at a source node maybe partitioned and distributed to multiple replica nodes.

EXAMPLE 3 Write Logs

In any of the examples herein, DML statements (e.g., DML structuredquery language (SQL) statements) can be replicated using write logs. Forexample, a write log format can be created that comprises a DMLstatement with additional information associated with the DML statement(e.g., additional information for use when the DML statement isexecuted). In some implementations, a write log entry comprises a singleDML statement.

In some implementations, a write log entry comprises a transactionidentifier (ID), a DML statement, parameter values, and nondeterministicvalues. The transaction identifier identifies (e.g., uniquelyidentifies) the DML replication transaction, which can include one ormore replicated DML statements. For example, the transaction identifiercan uniquely identify the DML replication transaction that occurs on thesource system and one or more replica nodes where the DML statement willbe executed.

The DML statement can be a statement used to modify (e.g., add, update,and/or delete) data. For example, the DML statement can be a SQLstatement used to modify data in a database. In some implementations,the DML statement is a SQL insert, update, or delete statement (e.g., asingle SQL insert, update, or delete statement).

Parameter values are values used by the DML statement. For example, theparameter values can be values for binding to variables in the DMLstatement (e.g., a prepared or precompiled DML SQL statement). When theDML statement is executed (e.g., replayed), bind variables can bereplaced with their corresponding parameter values. For example, if aDML statement contains a variable “NAME”, the variable can be replacedwith a specific string value when the DML statement is executed (e.g.,the variable “NAME” can be replaced with a specific value, such as“John”).

Nondeterministic values refer to values that may be different betweendifferent computing devices (e.g., different between source nodes andreplica nodes). For example, a timestamp function will return a currenttimestamp value when run on the source system, which may be a differenttimestamp value when run at a later time on the replica system. Inimplementations where the same value is to be used for suchnondeterministic functions, the nondeterministic function can beevaluated once (e.g., on the source system) and the resulting value canbe provided in the logical log to the replica system so that when theDML statement is executed on the replica system the same value will beused (the same value that was used at the source system). For example,the nondeterministic function (e.g., current timestamp function) can beevaluated at the source system during DML statement execution and theresulting value can be sent in a write log entry to the replica systemfor use when executing the DML statement at the replica system.

In some implementations, a write log entry is the set of shipped valuesto perform replication of data at a replica location (e.g., a replicanode) using a DML statement. In a specific implementation, the write logentry consists of:

-   -   Transaction ID    -   DML SQL statement    -   Parameter values: values of bind variables (labeled ‘?’) in        prepared statement    -   Nondeterministic values: If the SQL statement includes        nondeterministic functions, such as sequence or        CURRENT_TIMESTAMP function, evaluated values of the        nondeterministic functions may be included

As used herein, the terms “ship” or “send” to a destination entity referto any way of transmitting or otherwise conveying data within a computersystem or between two computer systems, whether the data is directlyconveyed or conveyed through one or more intermediate entities.Similarly, the term “receive,” such as to receive from a source entity,refers to the receipt of data within a computer system or between twocomputer systems, whether the data is received directly from thecomputer system of original transmission or received through one or moreintermediate entities.

As described above, write log entries can include information regardingother features of a database transaction. In one aspect, the write logincludes entries for when a transaction is committed by the sourcesystem. For example, a transaction may include multiple DML statements.In one implementation, the transaction is committed after all of the DMLstatements in the transaction have been executed on the source system.The write log may include additional entries, such as regardingindividual DML statements within the transaction having beenprecommitted on the source system.

EXAMPLE 4 Environment Providing Replication using DML Statements

In any of the examples herein, technologies can be provided for moreefficient replication (e.g., replication of database information) usingDML statements and write logs. For example, DML statements can beexecuted at a source system and incorporated into write logs for sending(shipping) to a replica system for execution to replicate data betweenthe source system and the replica system for one or more databasetables. Additionally, DML replication can be applied to different typesof storage engines, such as row stores, column stores, etc.

In some implementations, the concept of DML replication (e.g., DMLsynchronous replication) with write log shipping is intended to performreplication across multiple nodes with minimum replication overhead.However, synchronous replication can result in longer response times, asboth the source and replica(s) are updated in the same transactionboundary. That is, the transaction may not commit, even at the sourcesystem, until the operation is committed at the source system and allreplicated systems.

Asynchronous replication, where the replica is not necessarily updatedin the same transaction boundary, can allow for the use of a replicasystem while improving the response time for write transactions at thesource system. However, asynchronous replication typically involves arisk that a read request on the replica table may return informationthat is outdated compared to the source table.

FIG. 1 is a diagram 100 illustrating database data replication using DMLstatements and write log shipping. As depicted in the diagram 100, aclient 110 (e.g., a client computing device) communicates with a sourcesystem 120 (e.g., one or more server computers operating a database atwhich data will be modified and replicated to a replica system). Forexample, the client 110 can perform database manipulation operations(e.g., insert data, change data, and/or delete data in one or moredatabase tables stored at the source system 120). The client 110 canalso issue requests to read data (e.g., queries), which can be sent tothe source system 120 or a replica system 130.

The source system 120 includes a number of components, including asession/transaction component 122, a DML execution component 124, andstorage engines 126 (e.g., row-store and/or column-store storageengines). The storage engines 126 store database data in a persistencystore 128 (e.g., hard disk drives, solid-state drives, and/or othertypes of persistent storage).

The source system 120 can receive data manipulation operations (e.g.,operations to add, modify, and/or delete data, such as in the form ofinsert, update, and/or delete DML statements) from the client 110 and/orfrom other clients or sources. Upon receiving the data manipulationoperations (e.g., via the session/transaction component 122), the sourcesystem 120 can execute DML statements to perform the data manipulationoperations (e.g., via the DML execution component 124). The sourcesystem 120 can also create write log entries incorporating the DMLstatements and send them (as depicted at 140) to the replica system 130for execution, where they can then be read by requests from the client110.

In some cases, the replica system 130 can replicate all of the data ofthe source system 120. In other cases, the replica system 130 canreplicate a portion (e.g., selected tables) of the data of the sourcesystem. In yet further cases, data of the source system 120 can bereplicated to multiple replica systems 130, which can hold copies of thesame data, copies of different data, or combinations thereof.

The replica system 130 can receive the write logs and execute theentries contained within, including DML statements (e.g., along withother parameters, values, and/or other associated information in thewrite logs), transaction commit operations, and DML statement precommitoperations. For example, the replica system 130 can include componentssimilar to the source system 120 (e.g., session/transaction component132, DML execution component 134, storage engines 136, and persistencystore 138). The replica system 130 can replicate database informationstored at the source system 120 (e.g., one or more database tables) viaDML statements (e.g., so that database data changes at the source system120 are replicated to the replica system 130). In some cases, thereplica system 130 can execute the DML statements and return results tothe source system 120. Results can be provided to the source system 120and/or to the client 110.

FIG. 2 is a diagram depicting an example database environment 200 forperforming replication of database tables using DML statements and writelog shipping. The database environment 200 includes a number of replicanodes 220, 230 among which source database tables 216 are replicated.

As depicted in the database environment 200, a source system 210 (e.g.,a source host or a source node) comprises a number of componentssupporting database activity and replication. Specifically, the sourcesystem 210 stores source database tables 216 (e.g., in memory and/or inone or more persistent storage repositories). The source system 210includes a DML execution component 212 that executes DML statements thatread and/or write database data in the database tables 216. The sourcesystem 210 also includes a write log queue 214 for storing write logsand a replication handler 218 for sending write logs to other databasenodes (e.g., to replica nodes 220 and/or 230).

In order to replicate database tables (e.g., to replicate the databaseinformation stored in one or more database tables so that the databasetables remain synchronized between database nodes), the DML executioncomponent 212 of the source system 210 can receive a DML statement(e.g., originally from a user, application, or from another source) andexecute the DML statement on one of the source database tables 216(e.g., to add, modify, and/or delete data in the database table, whichcan be called a primary table). The DML execution component 212 can thencreate a write log entry (which includes the DML statement) and insertthe write log entry into the write log queue 214. Once the write logentry has been inserted into the write log queue 214, the DML executioncomponent 212 can be free to handle other DML requests (e.g., the DMLexecution component 212 does not have to wait for the write log entry tobe replicated to the replica nodes 220, 230 before performing other DMLoperations).

In some implementations, the DML execution component 212 includes anumber of threads of execution, where each thread can work independentlyto handle DML requests. In such an implementation, a thread can executea DML statement, create a write log entry (which includes the DMLstatement), insert the write log entry into the write log queue 214, andbe free to handle other requests without having to wait for replicationof the DML statement to be completed (e.g., for the DML statement to besent to other nodes or for results of DML statement execution at theother nodes).

In some implementations, the DML execution component 212 determinesparameter values and/or nondeterministic values used by the DMLstatement when executing the DML statement in relation to the databasetable. In such implementations, the DML execution component 212 caninclude the parameter values and/or nondeterministic values in the writelog entry with the DML statement. The DML execution component 212 canalso include a transaction identifier in the write log entry to identifythe replication transaction. The DML execution component 212 orders theDML statements for execution such that any given DML statement is notexecuted until the underlying data it affects is ready. For example, anupdate statement for a record is not executed until after an insertstatement adding the record. The DML execution component 212 can modifyinformation (e.g., in non-deterministic values or row-ID values that actas state counters) indicating how to serialize DML statements in thewrite log entries.

The source system 210 also comprises a replication handler 218 forhandling write log entries in the write log queue 214. The replicationhandler 218 can take write logs from the write log queue 214 and sendthem to one or more replica nodes (e.g., node 220 and/or node 230) inorder for the replica nodes 220, 230 to perform replication by executingthe DML statements contained within the write log entries. For example,the replication handler 218 can retrieve a write log entry from thewrite log queue 214 and send the write log entry to node 220 and/or tonode 230. The write log entry can pass through various internal orexternal structures, queues, etc., when it is routed to the replicanodes 220, 230.

A replica node receiving a write log entry, such as replica node 220,can receive the write log entry and insert it into a job queue 222.Reception of the write log entry by replica node 220 can be performed bya separate component (e.g., a write log receiver component, notpictured) or by the job queue 222. Once the write log entry has beenreceived and inserted into the job queue 222, a job execution component224 can retrieve the write log entry and execute the DML statementcontained within (e.g., along with parameter values and/ornondeterministic values, if present) on one of the replicated databasetables 226. Other replica nodes can also receive the write log entryfrom the replication handler 218 (e.g., node 230, with its own job queue232, job execution component 234, and replicated database tables 236).

In some implementations, database tables can be replicated on anode-by-node basis. For example, a source system (e.g., source system210) can store a full set of database tables while a first replica node(e.g., node 220) may replicate some or all of the tables stored at thesource system and a second replica node (e.g., node 230) may alsoreplicate some or all of the tables stored at the source system 210.Furthermore, each replica node 220, 230 may replicate the same tables asone or more other replica nodes, or may replicate different tables fromone or more other replica nodes. As an example, source system 210 maystore database tables 1, 2, and 3. Replica node 220 may replicatedatabase tables 1 and 2. Replica node 230 may replicate database tables1 and 3.

In some implementations, a write log entry that contains a DML statementmodifying a particular database table is sent to replica nodes thatreplicate the particular database table (e.g., only to those replicanodes that replicate the particular database table and not to replicanodes that do not replicate the particular database table). For example,the replication handler 218 can send a write log entry from the writelog queue 214 to replica nodes that replicate a database table beingmodified by the DML statement within the write log entry.

In some implementations, grouping of write log entries is performed. Forexample, multiple write logs entries that modify database tablesreplicated at a particular replica node can be grouped and sent to theparticular replica node. Consider an example arrangement in which thesource system 210 stores store database tables 1, 2, and 3, replica node220 replicates database tables 1 and 2, and replica node 230 replicatesdatabase tables 1 and 3. In this example arrangement, if the write logqueue 214 contains three write logs entries that all modify databaseinformation stored in database table 1, then the three write log entriescan be grouped (e.g., combined into a write log group) and sent to bothreplica node 220 and replica node 230 which both replicate table 1. Ifthe write log queue 214 contains two write logs entries that both modifydatabase information stored in database table 3, then the two write logentries can be grouped and sent to replica node 230, which replicatesdatabase table 3 (and not to replica node 220, which does not replicatedatabase table 3). If the write log queue 214 contains two write logentries that both modify database information stored in database table 1and one write log entry that modifies database information stored indatabase table 2, then a first write log group can be created forsending all three write log entries to replica node 220 and a secondwrite log group can be created for sending only the two write logentries that modify table 1 to replica node 230.

Write log grouping can be applied so that network resources are utilizedmore efficiently. For example, to minimize the penalty of replication,write log grouping can be used in which multiple write log entries formultiple clients are grouped into a single network communication. Thistechnique can reduce network resources needed to perform replication andmay increase DML execution throughput.

The job execution component 224, 234 of a replica node 220, 230 thatreceives write log entries can include a number of processes or threadsfor executing jobs in the job queue. For example, the job executioncomponent 224 of replica node 220 can include a number of job executionthreads that retrieve write log entries from the job queue 222 andexecute them. In some implementations, the job execution threads canexecute write log entries in parallel, which can increase efficiency. Indispatching write log entries, the job execution component 224 can useinformation (e.g., non-deterministic values or row-ID values that act asstate counters) to control the timing of execution, so that any givenDML statement is not executed until the underlying data it affects isready.

In some implementations, DML statements are executed on a source node(or multiple source nodes) and one or more replica nodes within the sametransaction boundary (also called an execution boundary). For example,one or more DML statements can be associated with a transaction (e.g.,identified by a transaction identifier). The one or more DML statementsassociated with the transaction can be executed at a source node (ormultiple source nodes), incorporated into write logs and sent to one ormore replica nodes, and executed at the replica nodes within the sametransaction boundary. In some implementations, the DML statements areexecuted at the replica nodes within a sub-statement boundary of theoverall transaction boundary.

In some implementations, DML statements within a transaction boundarycan be rolled back. For example, a DML statement being executed on asource node and one or more replica nodes can be rolled back across thesource and replica nodes (e.g., if execution at one of the nodes fails).In some implementations, partial rollback is supported, in which one ormore DML statements of a transaction can be rolled back independently ofone or more other DML statements of the transaction. For example, if atransaction includes multiple DML statements, and one of the DMLstatements is rolled back on the source node, that DML statement can berolled back on any replica nodes as well.

Execution of DML statements within a transaction boundary can providefor database consistency. For example, DML statements can be executed ona source node and one or more replica nodes and committed within thesame transaction boundary (e.g., committed using an atomic commitoperation).

In some implementations, thread decoupling is used to provide for moreefficient replication. In some implementations, separate threads (e.g.,dedicated handler threads) perform write log shipping (e.g., operationsincluding retrieving write logs from the write log queue, grouping,and/or sending to replica nodes). Using separate threads for write logshipping and DML execution can free up the DML execution threads fromhaving to perform write log shipping operations (e.g., the DML executionthreads can be free to handle other DML operations once they have placedwrite logs into the write log queue). For example, DML execution threadscan take pending DML jobs from other sources without having to wait forresults of write logs that have been sent to replica nodes.

FIG. 3 is a diagram depicting a database environment 300 for performingreplication of database tables from a source system 302 to a replicasystem having replica nodes 304, 306. While two replica nodes aredepicted, replication of database tables can be performed between thesource system 302 and any number of replica nodes.

As depicted in the example database environment 300, the source system302 includes a number of DML executors 312 (threads of execution forhandling DML requests). To support replication, a write set extractor316 extracts appropriate DML information from the DML request.Similarly, a transaction manager 320 monitors transaction commitoperations. Commit operations determine when the result of a transactionis available for reading. Read requests will typically receive the lastcommitted version of a record, even if the record is currently beingmodified by a DML operation.

A log generator 324 communicates with the transaction manager 320 andthe write set extractor 316. The log generator 324 generates logsentries for the write and commit operations and adds them to a write logqueue 314. The write log queue 314 is emptied, and log entries are sentto appropriate replica nodes (e.g., through one or more intermediarynodes) by a log sender 328 that communicates with the log generator 324.In some cases, write logs can be grouped together such that multiplelogs can be sent to a replica node in a single communication. When thedatabase environment includes multiple replicas, replicating differentportions of the source system (such as a source host), in particularimplementations, the replica node may only receive and execute writelogs for tables replicated by that replica node. Accordingly, logicallog grouping can take into account the tables replicated by a particularreplica node.

Each replica node 304, 306 includes a log receiver and dispatcher 332.The log receiver and dispatcher 332 receives the write log entries fromthe log sender 328. The log receiver and dispatcher 332 parses the writelog entries. Write operations are sent by the log receiver anddispatcher 332 to a parallel write log replayer 336, while commitoperations are sent by the log receiver and dispatcher 332 to atransaction commit log replayer 340.

As shown in FIG. 3 , the parallel write log replayer 336 includesmultiple replayers 344 that can operate concurrently. This structurehelps improve system performance by allowing multiple write operationson the replicated table to be carried out simultaneously, in the absenceof dependencies between the write operations. In at least someimplementations, write logs associated with the same transaction arereplayed by the same replayer 344 in the same order that the operationsoccurred at the source node.

In order to help ensure consistency between the source system 302 andthe replica nodes 304, 306, the transaction commit log replayer operatesserially, such as with a single replayer 348. Also, the log receiver anddispatcher 332 can use information provided with write log entries toorder write operations appropriately, honoring dependencies betweenwrite operations.

At least certain implementations of the present disclosure include anadditional feature that helps maintain consistency in the system 300.That is, each replicated table has associated with it a row-IDgenerator. The value of the row-ID generator is incremented each time awrite (change) operation is performed on a record within the table. Thevalue is copied to a row-ID column of the database record being changed.When the write log entries are generated by the log generator (324, FIG.3 ), the information may be included in the write log entries.

For example, operations inserting a new record will include informationfor the (new, incremented) row-ID of the inserted record. Operationsupdating a record will result in the write log including information forthe row-ID of the record prior to the write operation and theincremented row-ID after the write operation. Delete operations willinclude information for the row-ID of the deleted row. In particularimplementations, the delete operation does not, at least immediately,result in the deletion of a record. That is, the deleted record can bemaintained as a new version of the record and, in some examples, linkedto prior record versions. The new record can be assigned a new row-ID.The use of the unique row-ID can assist both in replicating data on anongoing basis, and when replication is resumed, such as due to manualintervention or a system exception.

Both source 302 and replica tables, such as tables located at replica304, can include the row-ID information, such as in a column of therespective table. When replication is restarted, such as on restart ofthe replica node 304 after a system exception, a manual restart, orswitching off and switching back on replication services, the row-IDcolumn values of the source table hosted by the source 302 can becompared to the row-ID column values of its replica table the replicanode 304. If there are any mismatching row-ID between them, then theycan be identified as a lost change and can be resolved by re-sending thecorresponding data from the source table or by deleting thecorresponding row at the replica.

For example, if a row-ID value is found both at the source 302 and thereplica 304, the data is consistent and no action needs to be taken forthat row-ID upon restarting replication. If a row-ID value is found onlyat the table at the source 302, the corresponding database record issent (or resent) from the source 302 to the replica 304 for insertioninto the copy of the table. If a row-ID value is found only at the tablecopy hosted by the replica 304, it can be deleted from the table copy.

The above-described method for synchronizing source and replica tablesupon restarting replication can be modified to improve performance orreduce the changes of data being inconsistent between source and replicatables, or between copies of different replicated tables hosted in thereplica 304. On such modification that may be used with at least certainExamples of the present disclosure is described in Example 16.

EXAMPLE 5 Record Version Visibility

Regarding the property isolation of the four properties in theprinciples of ACID (atomicity, durability, isolation, and durability)commonly used in guiding the operation of database environments, atleast some database environments of the present disclosure can provideone or both of two variants of snapshot isolation: statement-levelsnapshot isolation (SSI) and transaction-level snapshot isolation (TSI).Snapshot isolation provides non-blocking read access against anyconcurrent write transactions.

If a transaction consists of one or more statements (such as datamanipulation language, or DML, statements), which can be, for example,either of read and write (e.g. INSERT, UPDATE, or DELETE), in SSI, eachstatement reads data from a snapshot of the committed data at the timethe statement started. In TSI, each transaction reads data from asnapshot of the committed data at the time the transaction started,called the snapshot timestamp. In at least some database environments,SSI and TSI can co-exist, such as being configurable on a per userconnection. The definitions of SSI and TSI imply that data once read, ina statement or a transaction respectively, should be visible againwithin the same statement or transaction even though the data has beenchanged by a different concurrent transaction. For example, whenexecuting a join query with some predicate, the same record can bevisited multiple times within a single statement scope since theintermediate result of a query operator can be passed to the next queryoperator by a set of references to the filtered records (e.g. row IDs)without necessarily fully materializing them.

Although a Write Skew anomaly can happen under snapshot isolation, wheretwo transactions concurrently read overlapping data, make disjointupdates, and commit, it typically can be avoided in practice by usingSELECT FOR UPDATE properly in applications. Contrasted to otherconcurrency control options like optimistic concurrency control ortwo-phase locking, a benefit of snapshot isolation is that read queriescan proceed without any query abort or any lock waiting situation, eventhough they read a database object which is being changed by othertransactions.

Typically, in SSI and TSI, a snapshot timestamp is assigned to a newsnapshot when the new snapshot starts. Under SSI, each statement has itsown snapshot, while each transaction has its own snapshot under TSI. Thecost of the snapshot timestamp assignment operation typically becomesmore significant in SSI than in TSI, because the snapshot timestamp isassigned for each transaction under TSI, but for each statement underSSI. SSI thus offers more room for optimizations within the databasekernel, because it can be known which tables or partitions need to beaccessed in that particular snapshot scope by looking up the statement'squery plan before actually executing it.

In some aspects of the present disclosure, a database environmentincudes a table having database records. A new version of a record iscreated on each update operation instead of overwriting the existingrecord version. Even for record deletion operations, a new versionheader is typically created with an empty payload instead of deletingthe existing record right away. When creating a new record version, aversioning token, such as a version timestamp, representing the versioncreation time (the commit time (e.g., commit ID) of the transactioncreating the version), is stored, such as in a version header. In aparticular implementation, the version timestamp is derived from aglobal synchronization token, such as a transaction commit timestamp,maintained by a central transaction manager (which may be, for example,the source node 302 of FIG. 3 ) which will be incremented on each commitof a write transaction.

According to a particular example, the versions of a single record arechained to each other in a sorted order, such as by their versiontimestamps. Older versions in the version chain can be deleted, such asin a process sometimes referred to as garbage collection, when specifiedcriteria are met, such as when it is determined that there is nopotential reader in the system for that record version. In a particularimplementation, there being no potential reader in the system can bedetected by maintaining a minimum value of snapshot timestamps of activesnapshots in the system and comparing it with the version timestamps ofthe garbage collection candidates.

When a query tries to read a record version, the visibility of therecord is checked by comparing the query's snapshot timestamp with theversion timestamp of the candidate record version. If the versiontimestamp of the record is higher than the snapshot timestamp of thequery, the particular record version should typically not be visible tothe query because the created version of the record was committed afterthe query started. Otherwise, if the version timestamp of the record isnot higher than the snapshot timestamp of the query, the record versionshould typically be visible to the query.

One potential issue in snapshot isolation implementation is updatingversion timestamps of multiple different rows in a transaction with thetransaction's assigned commit timestamp in an atomic way. At versioncreation time, the embracing version timestamp can typically becorrectly and finally set only after the embracing write transactionreceives its commit timestamp within the commit procedure. However, ifthe versions of the write transactions are updated with their committimestamp one by one, then some of those versions could be visible toanother snapshot while the others might still be invisible. Such anoutcome would not fully comply with the atomicity rule in the ACIDproperties.

To avoid this potential anomaly concerning visibility atomicity, atransaction context may be maintained for each write transaction. When awrite transaction starts its first write operation, a transactioncontext entry is created. In a particular example, all created rowversions store a pointer to the transaction context entry in theirversion header field. At commit time, the transaction context entry isupdated with the write transaction's commit timestamp, and thus isavailable to the other versions through the pointer to the transactioncontext entry. After the transaction commit processing is completed, thecommit timestamp written in the transaction context entry isasynchronously propagated to the version timestamp fields. Thetransaction context entry may then be garbage-collected. With thisatomic indirect commit timestamp assignment to the created versions,visibility atomicity is still facilitated under this snapshot isolationimplementation.

FIG. 4 depicts an architecture 400 illustrating a transaction contextproviding version space management. The architecture 400 includes asnapshot timestamp store 410 that stores five active timestamps 12, 13,15, 16, and 19. Architecture 400 further includes a transaction contextstore 420 for four active write transactions, T1, T2, T3, T4, each withtheir own transaction context entry. A record chain store 430 holdsthree database records, Record 1, Record 2, and Record 3, each with ownversion chain of record versions 435. Each record version 435 includes aversion timestamp 440.

As shown, from the viewpoint of a snapshot whose snapshot timestamp is12, V₁₁ and V₂₁ are visible (because their version timestamps are lessthan the snapshot timestamp) but the other record versions 435 are not.V₁₃, V₂₂, and V₃₃ do not have their version timestamps yet, becausetheir write transactions are not yet committed. The timestamp ofversions V₃₁ and V₃₂ are greater than the snapshot timestamp (12), andso are not visible in the snapshot.

Under this transaction state, the record versions 435 store a pointer450 to the corresponding transaction context entries (T₂ and T₃). OnceT₂, for example, commits, then the transaction commit timestamp (19, asshown) of the transaction manager 460 at that time is copied to thetransaction context entry 420, thus providing visibility atomicityindirectly. Note that the data structures in FIG. 4 are provided to givea conceptual overview, but their actual implementation can be different.For example, depending on whether the corresponding table is a row storeor a column store, both of which may be supported in a single databasesystem, the storage layout of the record versions may be different.

Although read statements do not acquire locks in at least certainimplementations of the present disclosure, a write transaction typicallyacquires an exclusive lock of its updated record to ensure aserializable schedule of concurrent write operations. If the latestversion of the record is not visible to the snapshot after the exclusiverecord lock is acquired, then a transaction under TSI may throw an errorto the end user. A statement under SSI, however, may be configured torestart the statement by substituting its statement timestamp with anewer value of the transaction commit timestamp. In at least certainexamples, database objects are finally updated after lock acquisitionand validation. In further examples, lock tables are partitionedaccording to the location of their corresponding tables, or partitionedtogether with a multi-node deadlock detection implementation, to detectwhen dependencies between write operations carried out at differentnodes prevent transaction commitment.

Table 1 provides a set of symbols that may be used to describe adistributed database transaction protocol.

TABLE 1 Notations Symbol Description CTS Transaction commit timestamp ofthe source node, incremented when a write transaction commits CID(T_(i))Commit ID of a write transaction T_(i), assigned from CTS when T_(i)commits pCID(T_(i)) Precommit ID of a write transaction T_(i), assignedfrom CTS when T_(i) pre-commits Status(T_(i)) Status of a writetransaction T_(i), either of {Unused, Active, Precommitted, Committed,Aborted} TID(T_(i)) Transaction identifier of a transaction T_(i)STS(Si) Snapshot timestamp of a snapshot S_(i), assigned from CTS whenthe snapshot (statement or transaction) starts

Algorithm 1 shows how a statement checks if a record version V should bevisible or not to a snapshot S (a statement under SSI or a transactionunder TSI). For the visibility decision, first, V′s creatortransaction's state is checked. If it is aborted or active, then Vshould not be visible to S (lines 8 to 11). If it is committed, then V'sCID is compared to STS(S). V is visible to S only if STS(S) is equal toor larger than V's CID (lines 3-7).

Algorithm 1 Visibility decision algorithm: check if a record version Vshould be visible to a snapshot S or not  1: while TRUE do  2:  if V'sstatus is Committed then  3:   if V's CID ≤ STS(S) then  4:     returnTRUE  5:    else  6:     return FALSE  7:   end if  8:  else if V'sstatus is Aborted then  9:    return FALSE 10:   else if V's status isActive then 11:     return FALSE 12:  else if V's status is Precommittedthen 13:    if V's pCID ≥ STS(S) then 14:     return FALSE 15:    else16:     wait until V's status becomes Committed or Aborted 17:    end if18:   end if 19: end while

In addition to the basic visibility rules, the following extensions areprovided. As previously mentioned, and as recited in Algorithm 1, atleast certain implementations provide a statement or transaction statusof being precommitted, where the final commitment of the statement ortransaction is treated as in-doubt, with the visibility decision beingdelayed until the in-doubt status has been resolved, such as by thestatement or transaction being committed. If V's status is precommitted(lines 12 to 17), the corresponding record version's visibility decisionis postponed. The precommitted/in-doubt state makes sub-operations of atransaction commit effectively atomic without relying on any latch orlock.

The delayed visibility decision scheme may result in a situation where aread statement may need to wait for another write transaction's committo be completed. However, this waiting situation is typically uncommon,because it happens when a read statement is trying to check thevisibility of a record version which was created by a write transactioncommitted at the same time as the read attempt. To further reduce thepossibility of a reader waiting for an in-doubt transaction to complete,particular implementations of the disclosed distributed databasetransaction protocol can include early pruning of record versions thatwill never be visible.

As explained above, the in-doubt period of a transaction is started bysetting the transaction's state as precommitted. By assigning pCID,which is typically defined to be smaller than its CID value to bedecided later, at the time when the transaction state is set asprecommitted, record versions which will never be visible to the pendingreader statement, such as because the query was started later than thewrite operations and thus should only view records that were availablewhen the query was started, can be pruned. More specifically, if STS(S)is smaller than or equal to pCID(T) for a write transaction T and asnapshot S, then STS(S) will also be smaller than CID(T) because pCID(T)is smaller than CID(T) assigned by the commit protocol. Thus, ifSTS(S)≤pCID(T), it can be determined that the tested version V is notvisible to S (lines 13 to 14 of Algorithm 1) without waiting anyfurther.

As will be further described, table replication can be carried outsynchronously, where records on the source system and the replica systemare updated at one time (e.g., the commit is carried out atomically).However, synchronization can require more communication between thesource system and the replica system, and can delay execution. Tablereplication can be carried out asynchronously, where transaction commitis carried out atomically at the source system, but the changes arepropagated asynchronously to the replica system. In asynchronousreplication, read operations received at the replica and source systemsmay retrieve different results. Specifically, the read operation at thereplica may return data that is out of date with respect to the versionof the source system.

EXAMPLE 6 Table Replication and Table Replication Protocols

As described above, table replication can be useful in facilitating theimplementation of distributed database systems. FIG. 5A illustrates adatabase environment 500 that does not include data replication. Theenvironment 500 includes an application server 505 that communicateswith a node 510 acting as a database server and hosting Table 1 andTable 2. The application server 505 sends write requests 515 and readrequests 520 to the node 510. Because the environment 500 includes asingle node 510, the performance of the environment 500 is tied to theresources of a single host, and can thus degrade if the number of writerequests 515 or read requests 520 becomes too large.

FIG. 5B illustrates an environment 525 providing for replication of databetween a plurality of database server nodes 535, 540, 545, 550, each ofwhich is in communication with an application server 530 and hosts Table1 (or a copy thereof) and Table 2 (or a copy thereof). The applicationserver 530 sends write requests 555 to the node 535, which stores the“source” versions of Table 1 and Table 2. However, the applicationserver 530 can send read requests 560 to any of the nodes 535, 540, 545,550.

The results of the write requests 555 sent to node 535 are propagated tonodes 540, 545, 550 by a replication process 565. Because the node 535is the only node that receives the write requests 555 for Tables 1 and2, and changes to those tables at node 535 are replicated to the othernodes 540, 545, 550, node 535 acts as a source node for Tables 1 and 2.Nodes 540, 545, 550 act as replica nodes for Tables 1 and 2.

For purposes of query processing and other online analytical processing(OLAP) operations, the environment 525 of FIG. 5B provides for loadbalancing as compared with the environment 500 of FIG. 5A, as readrequests 560 can be sent to the source node 535 and any of the replicanodes 540, 545, 550.

Table replication can also help a database system avoid inefficientcross-node join operations. FIG. 6A illustrates a database system 600having an application server 605 that is in communication with adatabase server node 610 hosting Table 1 and a database server node 615hosting Table 2. Application server 605 sends write requests 620 andread requests 625 to node 610 for Table 1. Application server 605 sendswrite requests 620 and read requests 625 to node 615 for Table 2. Anoperation, such as a SQL join operation 630 accessing Tables 1 and 2must access both nodes 610 and 615, which can cause performancedegradation compared with an operation where only one database servernode is accessed.

FIG. 6B illustrates an alternative environment 635 that is generallysimilar to the environment 600. However, Table 2 has been replicatedfrom node 615 to node 610 using a replication process 640. A read-onlyoperation, such as SQL join operation 630, accessing both Tables 1 and 2can simply be routed to node 610, improving performance by helping toavoid cross-node operations. As will be further described, a query canbe sent from the application server 605 to a database server node 610,615 to be precompiled. A precompiled query can indicate on which nodesthe query is executable. When the query is to be executed, theprecompiled query can be sent from the application server 605 directlyto an appropriate node.

As described above, replication can be carried out synchronously orasynchronously. Asynchronous table replication (ATR) can help reduceperformance degradation resulting from table replication, but it can becomplex to implement and use. For example, because replication isasynchronous, a replica table may have an outdated state compared withits source table. To address this issue, application developers may needto distinguish their workloads or queries that run on such asynchronousreplicas, versus those workloads or queries that run only on the sourcenode, or on a replica operating under synchronous replication.

Synchronous table replication provides a simpler usage model, becauseall the replicas have the same state as their source tables. However,typical synchronous table replication implementations add highperformance overhead to source transactions, particularly in view of thefollowing two implementation issues. Typical synchronous tablereplication protocols synchronize the source table with the replicatables for each DML statement.

FIG. 7 illustrates an example synchronous table replication protocol700. The operations of the protocol 700 are carried out using a sourcenode 704 and a replica node 708, having respective execution timelines706, 710. DML statements DML1 and DML 2 are executed at the source node704 in blocks 714 and 724. These DML statements are synchronously sentto the replica node 708 in communications 716 and 726, respectively.DML1 is executed at the replica node 708 in process 718. DML2 isexecuted at the replica node 708 in process 728.

After execution of DML1 and DML2 at the replica node 708, the replicanode 708 sends synchronous acknowledgments to the source node 704 incommunications 720 and 730, respectively. In FIG. 7 , the source node704 waits for the synchronous acknowledgement for DML1 before executingDML2. Query1, associated with transaction T1, is executed by the sourcenode in process 734. Note that Query1 is executed after DML1 and DML2have been synchronized between the source node 704 and the replica node708, with synchronous acknowledgements received from the replica node708.

When the transaction T1 is to be committed, in step 738, the source node704 prepares the replica 708 to commit the transaction by sending asynchronous prepare commit request 740. After receiving the notification740, the replica node 708 prepares the transaction for commitment inblock 742, including writing a prepare-commit log to persistent storageand marking the transaction as “in-doubt” at the replica node 708. Thereplica node 708 then sends a synchronous prepare commit acknowledgement744 to the source node 704.

When the source node 704 receives the acknowledgement 744, the sourcenode 704 writes a commit log for the transaction in block 748, includingwriting the commit log to persistent storage. The source node 704 sendsa synchronous notification, or commit request, 754 to the replica node708 in block 752. When the notification 754 is received by the replicanode 708, the replica node 708, in block 756, writes a commit log forthe transaction, including writing the commit log to persistent storageand marks the transaction as “committed” at the replica node 708. Thereplica node 708 then sends a synchronous commit acknowledgement 758 tothe source node 704. Upon receiving the commit acknowledgement 758, thesource node 704 acknowledges the commit to the client (not shown) inblock 762.

In the conventional two-phase commit protocol 700, the execution ofevery DML statement requires a network round trip between the sourcenode 704 and the replica node 708. Two additional round trips arerequired as part of the commit process. These network communications candelay transaction processing, and can increase the network andprocessing loads at the source node 704, which can be undesirable,particularly if the system using the protocol 700 include multiplereplica nodes. Further delays are incurred by the system waiting toacknowledge the commit to the client in block 762 until the write logshave been written to persistent storage at both the source node 704 andthe replica node 708, in blocks 748, 756.

Note that the replication protocol 700 is completely synchronous. EachDML statement is fully executed by the source node 704 and the replicanode 708 before the next DML statement, or another operation, isexecuted. In addition, the commit process is synchronous, as the preparecommit step 738 and the acknowledge commit step 752 are not completeduntil a confirmation or acknowledgement from the replica node 708 hasbeen received by the source node 704.

Synchronous table replication is implemented in such a way becausesubsequent read operations in the same transaction may try to read datachanges from the replica node. For example, the transaction executionscenario of FIG. 7 includes DML operations DML1 and DML 2 that areexecuted on the source node for transaction T1. Query1 should be able toread the outcome of DML1 because both Query1 and DML1 belong to the sametransaction T1. If DML1 is asynchronously propagated to the replica,then there is chance that when Query1 is dispatched to the replica,Query1 may not see the result of execution of DML1, even though DML1 wasexecuted at the source node as part of the same transaction. (Forexample, Query1 may arrive before DML1 at the replica node.) Althoughthe example transaction of FIG. 7 includes two DML statements, ingeneral, a transaction can include any number of DML statements, up toan implementation-dependent threshold. Also, in general, a transactioncan include any number of queries, up to an implementation-dependentthreshold.

FIG. 8 illustrates an asynchronous replication protocol 800. Theprotocol 800 is carried out at a source node 804 and a replica node 808,having respective execution timelines 806, 810. A first DML statement,DML1, of a transaction T1, is executed on Table 1 by the source node 804at 814. The first DML statement is asynchronously sent to the replicanode 808 in communication 816, and is executed by the replica node at818. A second DML statement, DML2, of T1 is executed on Table 2 by thesource node 804 at 822. The second DML statement is asynchronously sentto the replica node 808 in communication 826, and is executed by thereplica node at 830.

Without coordinating with the replica node 808, the source node 804writes a commit log entry for the transaction T1 at 834. The source node804 sets the transaction as committed at 838. The source node 804asynchronously sends the commit operation (including a commit ID) to thereplica node 808 in communication 842. The replica node 808 writes acommit log entry for the transaction at 846, and marks the transactionas committed at 860. Without waiting for the replica node 808 to start,or complete, its commit processing, the source node 804 returns a commitacknowledgement to a database client at 854.

Although the DML statements and commit operations are shown as beingsent in separate communications 816, 826, 842, in other cases, two ormore of these statements and operations can be grouped into a singlecommunication. As explained above, while the protocol 800 includes lessoverhead, it can result in database read operations seeing differentdata versions depending on whether the query is processed by the sourcenode 804 or the replica node 808. In particular, at time T₁, thetransaction T1 has committed at the source node 804, and so a query willsee the versions of Table 1 and Table 2 having the changes of T1. Incontrast, a query executed by the replica node 808 at time T₁ will see aversion of Table 1 and Table 2 without the changes of T1.

Variants of synchronous table replication can provide strongerconsistency guarantees (e.g., queries executed by the source and replicanodes will see the same version of the database) than asynchronous tablereplication, but with reduced overhead compared with completelysynchronous replication. An example protocol 900 is illustrated in FIG.9 , and includes operations carried out at a source node 904 and areplica node 908, with respective execution timelines 906, 910.

At 914, a DML statement DML1 on Table 1 is executed at the source node904 and then asynchronously sent to the replica node 908 incommunication 916. At 918, DML1 is executed on the replica node 908.Another DML statement DML2 on Table 2 is executed at the source node 904at 922, and then asynchronously sent to the replica node 908 incommunication 924. DML2 is executed at the replica node 908 at 926.

In optional block 930, Query1, part of the same transaction as DML1 andDML2, is carried out at the source node 904. In some cases, Query1 isreceived by the source node 904 directly from a database client. Inother examples, Query1 is forwarded to the source node 904 by thereplica node 908. For example, the replica node 908 optionally receivesQuery1 at 934.

In some cases, the replica node 908 forwards the query to the sourcenode 904, such as in optional communication 938, when the replica node908 determines that the query will access tables modified in the sametransaction as the query. In other examples, the query may be first heldby the replica node 908 pending the execution by the replica node 908 ofthe DML statements upon which the query depends in the same transaction.Upon execution of the DML statements by the replica node 908, thereplica node 908 may optionally process the query at 942.

In other examples, if the query is pending at the replica node 908 for atime exceeding a predetermined threshold, the query is forwarded to thesource node 904 by the replica node 908 in optional communication 938.The source node 904 then executes the same-transaction query in optionalblock 930. By ensuring that the necessary DML statements have beenexecuted on the replica node 908 before executing Query1, or forwardingQuery1 to the source 904, the protocol 900 can ensure that Query1accesses the appropriate version of the database, and a version thatwill provide consistent results even though DML statements are sentasynchronously from the source node to the replica node.

The predefined threshold may depend on a particular implementation andcan be, for example, about 0.1 milliseconds, about 0.25 milliseconds,about 0.5 milliseconds, about 0.75 milliseconds, about 1 millisecond,about 1.5 milliseconds, about 2 milliseconds, about 5 milliseconds,about 10 milliseconds, or about 50 milliseconds, such as being 0.1milliseconds, 0.25 milliseconds, 0.5 milliseconds, 0.75 milliseconds, 1millisecond, 1.5 milliseconds, 2 milliseconds, 5 milliseconds, 10milliseconds, or 50 milliseconds. In further implementations, thepredefined threshold is between about 0.05 milliseconds and about 50milliseconds, between about 0.1 milliseconds and about 10 milliseconds,between about 0.25 milliseconds and about 5 milliseconds, between about0.5 milliseconds and about 2.5 milliseconds, or between about 0.1milliseconds and about 1 millisecond, such as being between 0.05milliseconds and 50 milliseconds, between 0.1 milliseconds and 10milliseconds, between 0.25 milliseconds and 5 milliseconds, between 0.5milliseconds and 2.5 milliseconds, or between 0.1 milliseconds and 1millisecond. In other implementation, the predefined threshold has someother value.

The protocol 900 can provide improved processing of queries, and DMLstatements, because database operations are propagated asynchronously.For example, the source node 904 can execute DML2 without waiting forDML1 to be synchronized with the replica node 908. Similarly, Query1 canbe executed by the source node 904 without waiting for synchronizationof DML1 and DML2 with the replica node 908.

At 946, the source node 904 prepares to commit the transaction thatincludes DML1, DML2, and Query1. The source node 904 sends the replicanode 908 a synchronous prepare commit request in communication 950. Thereplica node 908 precommits the transaction at 954, marking thetransaction as “in-doubt” at the replica node 908. In someimplementations, the precommitting can include having the replica node908 write a precommit log to persistent storage.

The replica node 908 sends a synchronous precommit acknowledgment to thesource node 904 in communication 960. During the period wherecommunications 950, 960 and the precommit process 954 are occurring, thesource node 904 writes a commit log entry at 946. Overlapping writingthe write log at the source node 904 with the precommit process at thereplica node 908 can help reduce delays incurred by the replicationprocess.

If desired, communications between the source node 904 and the replicanode 908 can be grouped to further reduce the effect of networkcommunications on the time needed to commit transactions at the sourcehost 904, or to precommit or commit transactions on the replica node908. For example, concurrent precommit requests 950 can be grouped bythe source node 904 into a single physical network call. Similarly,precommit acknowledgements 960 from the replica node 940 can be groupedinto a single physical network call. The asynchronous commit requests972 (described below) from the source node 904 may similarly be groupedto be sent to the replica node 908.

At 964, after the commit process 946 has completed at the source node904, and the source node 904 has received the synchronous precommitacknowledgement 960 from the replica node 908, the source node 904acknowledges the commit of the transaction to a client (not shown). At968, the source node 904 prepares the replica node 908 to commit thetransaction, including by sending an asynchronous commit request incommunication 972. In some examples, preparing the replica to commit at968 occurs before, or in parallel with, acknowledging the commit to theclient at 964.

The replica node 908 commits the transaction at 976, including bywriting a commit log to persistent storage and marking the transactionas “committed” at the replica node 908.

In addition to expediting transaction processing at the source node bynot requiring synchronization at every DML transaction, the protocol 900can improve replication performance by including a singlesynchronization point (the precommit process, communications 950 and960) as part of the transaction commit process. This process also allowsthe results of the transaction to be made available at the source node904 (for queries in the same transaction or outside the transaction)without waiting for the transaction to be fully committed at the replicanode 908. The replicated data can be made available at the replica node908, to queries outside the transaction, when the transaction iscommitted by the replica node 908. Because the replica node 908 marksthe DML statements as being in-doubt until the transaction is committed,and because queries outside the transaction will not execute on thereplica node 908 if the results of earlier changes in the transactionare not visible, there is no danger of read requests obtaining out ofdate data from the replica node 908.

If desired, various modifications can be made to the protocol 900. Forinstance, rather than having the DML statements asynchronously sent fromthe source node 904 to the replica node 908, the DML statement can besent synchronously, but the commit acknowledgment at 972 can remainasynchronous. In addition, or alternatively, the commit acknowledgementat 972 can be made synchronous.

EXAMPLE 7 Replicated Database Environment Providing Fault-Tolerant andAdaptive Query/Prepared Statement Routing

In replicated database systems, including database systems using areplication protocol described in Example 6, all or a portion of areplica node may become unavailable. When a client attempts to connectwith an unavailable replica node, or retrieve particular data (e.g., viaa read request/query) that has become unavailable, database systemstypically return an error. In addition, in many systems, when an erroris detected at a replica node, replication for the entire databasesystem is suspended. Thus, a high number of aborted queries can beencountered when a replica node becomes unavailable, and systemperformance can be drastically reduced.

FIG. 10 illustrates an architecture 1000 in which certain disclosedinnovations can be implemented that can allow for queries or preparedstatements (including a prepared statement for a query) to be reroutedwhen a replica node, or particular data of a replica node, becomesunavailable. The architecture 1000 includes a database client 1004, asource node 1008, and one or more replica nodes 1012. The databaseclient 1004 can include a client library 1016. The client library 1016can include an active node store 1024 that includes identifiers ofavailable database nodes of the architecture 1000, including the sourcenode 1008 and any available replica nodes 1012. The store 1024 can beperiodically updated, such as by the source node 1008 or one of thereplica nodes 1012, whenever there is a change in the availabilitystatus of a node. Alternatively, the database client 1004 can directlydetermine the availability status of nodes 1008, 1012. Although thedatabase client 1004 can include information about the nodes that arepresent in the architecture 1000, and with which the database client canestablish a connection, the store 1024 may not include information aboutthe particular data stored by a particular node. Thus, the databaseclient 1004 may not have information sufficient to determine which nodesare suitable for processing a particular query.

In distributed systems, the database client 1004 can typically sendstatements (e.g., SQL statements, such as for a query) to one of thenodes to be prepared, providing prepared statements (which can be, forexample, prepared statements for queries) 1028. Each prepared statement1028 can be associated with an identifier 1032, which can be used toidentify a corresponding prepared statement and/or query execution planat a node 1008, 1012, and a list of suitable nodes 1036 for processingthe prepared statement. The list of suitable nodes 1036 can includenodes that are capable of processing the prepared statement. In somecases, the list of suitable nodes 1036 can be ordered, such as beingordered by how efficiently each node may be able to process the preparedstatement, which can be based on, for example, a communication speedwith the node, a processing load of the node, a portion of the preparedstatement that can be executed by the node, and combinations thereof.

Preparing a statement, such as a SQL statement, can expedite statementprocessing, including because the prepared statement can includeinformation about which nodes are best suited to process the statement,such as storing information needed for at least part of the statement.In this way, rather than, for example, sending a query (or other SQLstatement) to a replica node 1012 that does not store the needed data,and then forwarding the query from that replica node to another replicanode, the query can be sent directly from the database client 1004 to areplica node 1012 that can at least partially process the query, whichcan reduce the number inter-node communications and speed queryprocessing.

Each node 1008, 1012 can store one or more tables 1038, which can besource tables (where data can be both read from and written to) orreplica tables (from which data can be read). The nodes 1008, 1012 canmaintain one or more identifiers 1040 that can be used to track thestatus of the database system of the architecture 1000. In some cases,one or more of the identifiers 1040 can be synchronized, including beingperiodically synchronized, among multiple nodes 1008, 1012. In othercases, one or more of the identifiers 1040 can be different between thedifferent nodes 1008, 1012.

A particular identifier 1040 can be associated with metadata versioning.For instance, certain metadata entities, such as prepared statements1028, can become out of date based on certain changes to the databasesystem. To ensure that the database system operates appropriately,metadata entities can be checked to see if they are out of date withrespect to an identifier 1040, and out of date entities can bereevaluated or recreated. In particular, an identifier 1040 associatedwith metadata versioning can be used by a node 1008, 1012 to determinewhether a prepared statement 1028 sent by the client 1004 is out ofdate. The identifier 1040 of the nodes 1008, 1012 can increment upon theoccurrence of particular database events, such as a change in theavailability status of a node 1012, such as the node becoming inactive(e.g., because the replica node has crashed or has been turned off orotherwise removed from communication with the other nodes 1008, 1012 orthe database client 1004) or all or a portion of the replica node isotherwise unavailable (e.g., there is a network error, the replica nodeis out of memory, a process of the replica node has become deadlocked,etc.).

The identifier 1040 may also be incremented if there is a change in thereplication behavior of the architecture 1000, such as if replication isstopped, started, or modified (e.g., replica nodes 1012 are added orremoved from the replication environment, or there is a change in thedistribution of replicated data among the replica nodes). In some cases,a change in the replication status (e.g., replication being started orstopped), or a replica node becoming unavailable or available, can bedetected at the source node 1008 and the replica nodes 1012. In othercases, a change can be detected by the source node 1008, and the sourcenode can direct the replica nodes 1012 to update their identifiers 1040.For instance, if replaying a write transaction at a replica node 1012encounters errors, the errors may be detected by the source node 1012,but may not be detectible by the other replica nodes. In this case, thesource node 1008 can inform the other replica nodes 1012 that aparticular replica node is unavailable, or particular tables or recordsof the particular replica node are unavailable, and direct the replicanodes to update their identifiers 1040.

Statements can be prepared (including for queries) by a statementcompiler component 1044 of the source node 1008 and the replica nodes1012. In preparing a statement, the statement compiler component 1044can access system metadata 1048, which can include information 1052regarding active nodes 1008, 1012 in the architecture, and thedistribution of data among the nodes (e.g. a list of tables replicatedat particular database system nodes). The system metadata 1048 can beused by the statement compiler component 1044 to determine candidatenodes for executing all or a portion of a statement being prepared.These candidate nodes can be included in the list of suitable nodes 1036included in the prepared statements 1028 of the database client 1004.

When a request to prepare a statement is received from the databaseclient 1004, the statement compiler 1044 can prepare the statement,including creating a stored prepared statement 1056 that can include theidentifier 1040 (e.g., a value indicating when the prepared statementwas generated) and an identifier 1060 for the particular preparedstatement (which, in some cases, can be the same as the identifier1032). If the prepared statement 1056 is executable at the node 1008,1012 where the statement is being prepared (e.g., because the node hasat least one table 1038 with relevant data), the statement compiler 1044can generate (or cause to be generated) a query execution plan 1064,which can also include the identifier 1040 (e.g., a value correspondingto when the query execution plan 1064 was generated) and an identifier1068 (which, in some cases, can be the same as the identifier 1060 orthe identifier 1032). When a request to execute a prepared statement1028 is received by a node 1008, 1012 from the database client 1004, thenode can determine whether a prepared statement 1056 is available, and,if so, can determine if the prepared statement is associated with aquery execution plan 1064. If a query execution plan 1064 exists, thequery execution plan can be executed by the node 1008, 1012 (optionally,after determining that the prepared statement 1054/query execution planare still valid, such as using values of the identifier 1040).

Note that, in at least some cases, prepared statements 1056 and/or queryexecution plans 1064 can be specific to a particular node 1008, 1012.So, if, for example, a node 1008 1012 creates a prepared statement thatindicates that the prepared statement can be executed on another node,before the other node executes the prepared statement, the databaseclient 1004 may need to request the other node to also generate aprepared statement 1056, and potentially a query execution plan 1064.After generating those entities, the database client 1004 can requestthe other node to execute the prepared statement 1056 generated by thatnode. In some aspects, different prepared statements 1056, and queryexecution plans 1064, can have different version identifiers 1040 (e.g.the versions may have been created at different times by differentnodes).

If a prepared statement 1028 is received at a node 1008, 1012 from thedatabase client 1004, the identifier 1032 of the prepared statement canbe used to retrieve the appropriate prepared statement 1056. The valueof the identifier 1040 associated with the prepared statement 1056 canbe compared with a current value of the identifier 1040. If the resultof the comparing indicates that the status of the database system of thearchitecture 1000 has changed since the statements 1056, 1028 wereprepared (and, potentially, when a corresponding query execution plan1064 prepared), the prepared statement 1028 can be invalidated, thestatement prepared again, the new prepared statement 1056 stored at thenode 1008, 1012, and a new prepared statement 1032 sent to the databaseclient 1004.

In this way, when there is a change in replica nodes 1012 available toprocess a prepared statement, rather than simply aborting the statement(such as aborting a query), the statement can be re-prepared andexecuted by currently available replica nodes, or the source node(including after such nodes also prepare the statement and, optionally,a query execution plan). Or, in other cases, when a replica node 1012becomes unavailable, or problems are encountered during replication,prepared statements 1028 can be directed to the source node 1008 only.In some cases, routing prepared statements 1028 to the source node 1008can be accomplished by updating the list of active nodes 1024 at theclient device 1004 to only list the master node. In other cases, when astatement is sent to a source node 1008 or a replica node 1012 to beprepared, or a prepared statement sent to be executed, the statement isprepared to be executed only at the source node. When replication isreactivated, the list of active nodes 1024 at the database client 1004can be updated to include the replica nodes 1012, or a metadataidentifier 1040 can be incremented, so that a statement sent to a node1008, 1012 to be prepared, or a prepared statement 1028 sent forexecution, can be prepared (including re-prepared) for execution atappropriate replica nodes 1012 (as well as, potentially, the source node1008).

EXAMPLE 8 Adaptive Prepared Statement/Query Routing Strategies

FIGS. 11A and 11B illustrate various scenarios for routing preparedstatements/queries in a replicated database system 1100 after a statuschange of a replica node, such as using queries embodied in a preparedstatement. The database system 1100 includes a database client 1104having a prepared statement (or precompiled query) 1108 associated withan identifier 1112 (e.g., the identifier 1032) and a list 1116 ofavailable nodes in the database system. The database system 1100includes a source node 1120 (which, in some cases, can represent asource database system having a plurality of nodes, and can bedesignated as S), a first replica node 1124 (which can be designated asR1), and a second replica node 1128 (which can be designated as R2).

Each of the nodes 1120, 1124, 1128 includes an identifier 1132, whichcan be associated with a current metadata version. In at least somecases, the identifiers 1132 can be different among the different nodes1120, 1124, 1128, but optionally can be periodically synchronized. Thesource node 1120 includes a plurality of source tables 1136. Eachreplica node 1124, 1128 includes replicated tables 1140 for all or aportion of the source tables 1136 of the source node 1120. Although FIG.11A illustrates all source tables 1136 being replicated, in other casesa replica node 1124, 1128 may only replicate a portion of the sourcetables, and different replica nodes may replicate different tables.

Diagram 1150 illustrates the database system 1100 at a time To. Thedatabase system 1110 includes tables T1, T2, T3, T4, which are stored inthe source node 1120 and at each of the replica nodes 1124, 1128. Thelist 1116 of available nodes at the database client 1104 lists S, R1,and R2 as available in the database system. The prepared statement 1108is executable at any of nodes S, R1, and R2.

At a time T₁, illustrated in diagram 1152, replica node 1128, R2,becomes unavailable. For instance, replica node 1128 could have crashed,could have experienced a network error, or could be otherwiseunresponsive. The list 1116 of available nodes at the database client1104 is updated to reflect that replica node 1128 is unavailable. Insome cases, the unavailability of replica node 1128 is determined by thedatabase client 1104. In other cases, the unavailability of the replicanode 1128 is sent to the database client by the source node 1120 or thereplica node 1124.

In the scenario represented in diagram 1152, the prepared statement 1108is only executable at the source node 1120. In some cases, the preparedstatement 1108 can be indicated as executable only at the source node1120 by incrementing the identifiers 1132 of the source node 1120 andthe replica node 1124. When the prepared statement 1108 is sent to thesource node 1120 or the replica node 1124, the source or replica nodedetermines that the version identifier of the prepared statement (e.g.,the identifier 1040 of prepared statement 1056) of the preparedstatement is out of date, prepares the statement to be only executableat the source node, and sends the new prepared statement to the databaseclient 1104.

In a specific example, a prepared statement 1108 is associated with aversion timestamp of 11, and the current value of the identifiers 1132is 11. After the replica node 1128 has been determined to beunavailable, the source node 1120 and the replica node 1124 incrementtheir identifiers to 12. When the prepared statement 1108 is received,such as by the replica node 1124, the version timestamp of the preparedstatement (11) is determined to be less than the identifier value of thereplica node 1124 (12), as so the prepared statement can be determinedto be out of date, or in need of being re-prepared.

In other cases, the list 1116 of available nodes at the database client1104 is updated to list only the source node 1120 as available in thedatabase system 1100, optionally also incrementing the identifier 1132,invalidating the prepared statement 1108, re-preparing the statement,and sending the updated prepared statement to the database client (asdiscussed above, although the prepared statement may only list thesource node as a node that can execute the prepared statement). Thus, inthe scenario in diagram 1152, when a replica node 1124, 1128 becomesunavailable, prepared statements (for example, representing a query) arerouted only to the source node 1120.

Diagram 1154 illustrates an alternative for how the database system 1100may operate when a replica node 1124, 1128 becomes unavailable. The list1116 of available nodes at the database client 1104 is updated toreflect that source node 1120 and replica node 1124 are available, whichmay be carried out as described above. In this case, rather than beingexecutable only at the source node 1120, the prepared statement 1108 isexecutable at the source node or at the replica node 1124. When theprepared statement 1108 is sent to the source node 1120 or the replicanode 1124, the prepared statement can be identified using the identifier1112, a current (incremented) value of the identifier 1132 can becompared with the version identifier of the prepared statement (e.g.,the identifier 1040 associated with the prepared statement 1056). Theprepared statement 1108 can be determined to be out of date, and thestatement re-prepared (e.g., a query plan recompiled) to indicate thatit can be executed at the source node 1120 at the replica node 1124.

The example scenarios of FIG. 11A illustrate operation of the databasesystem 1100 when a replica node 1124, 1128 is completely unavailable, oris treated as being completely unavailable (e.g., even if part of thereplica node is operational, the replica node is treated as beingunavailable). However, in some cases, there may be a problem with areplica node 1124, 1128 that affects only certain tables, such as awrite process for a particular table that is experiencing errors or isdeadlocked. In some aspects of the present disclosure, rather thanmarking an entire replica node 1124, 1128 as unavailable, the replicanode can be marked as unavailable (or available) for particular data(e.g., particular tables or records).

When a replica node 1124, 1128 is partially available, the replica nodecan remain in the list 1116 of the database client 1104. When part of areplica node 1124, 1128 is unavailable, the identifiers 1132 can beupdated, forcing a prepared statement 1108 to be re-prepared when theprepared statement is sent from the database client 1104. Preparedstatements 1108 that do not involve the unavailable portion of a replicanode 1124, 1128 can continue to be routed to the source node 1120 andall replica nodes. Prepared statements 1108 that involve the unavailableportion of a replica node 1124, 1128 can be routed to the source node1120 and any replica node 1124, 1128 where the needed data is available.

In FIG. 11B, part of replica node 1128 has become unavailable, such thattable T3 is no longer available. In diagrams 1156 and 1158, the sourcenode 1120 and both replica nodes 1124, 1128 remain in the list 1116 ofavailable nodes at the database client 1104. Diagram 1156 illustrates ascenario for a statement (e.g., a query) that accesses tables T1 and T4.Tables T1 are T4 are available at all of the nodes 1120, 1124, 1128.When, table T3 becomes unavailable, the identifiers 1132 of the nodes1120, 1124, 1128 can be incremented. When the prepared statement 1108 issent to a node 1120, 1124, 1128 to be executed, the prepared statementis determined to be out of date, the statement re-prepared, and theupdated prepared statement sent to the database client 1104. The updatedprepared statement can then be sent to any of nodes 1120, 1124, 1128,where it is executed (including after preparing the statement and,optionally, creating a query execution plan).

Diagram 1158 illustrates a scenario for a prepared statement 1108 thataccesses tables T2 and T3. Although table T2 is available at all of thenodes 1120, 1124, 1128, table T3 is not available at replica node 1128.As described above, when table T3 became unavailable, the identifiers1132 of nodes 1120, 1124, 1128 were incremented. When the preparedstatement 1108 that accesses T2 and T3 is sent to a node 1120, 1124,1128, the prepared statement is determined to be out of date, thestatement is re-prepared, and the updated prepared statement is sent tothe database client 1104. The updated prepared statement 1108 can besent to the source node 1120 or the replica node 1124, where it isexecuted (including after preparing the statement and, optionally,creating a query execution plan).

Tracking the availability of data at a level more granular than whetheran entire replica node is available or not (e.g., tracking theavailability of individual tables) can add additional overhead to thedatabase system 1100. However, this more granular level of tracking canmaintain more of the benefits of replication, as the unavailability of asingle (or limited number) of tables on a replica node will not preventthat replica node from servicing other queries, which can increase thethroughput and response time of the database system 1100.

In any of the example scenarios depicted in FIGS. 11A and 11B, when thereplica node 1128 becomes available again (either the entire node, as inFIG. 11A, or table T3, as in FIG. 11B), the metadata identifiers 1132 ofthe nodes 1120, 1124, 1128 can be incremented. The next time a preparedstatement 1108 is sent from the database client 1104 to a node 1120,1124, 1128, the prepared statement can be determined to be out of date,the statement re-prepared, and the updated prepared statement sent tothe database client. The updated prepared statement 1108 can includereplica node 1128 as an active node capable of processing the preparedstatement. The updated prepared statement can be sent to one of thenodes 1120, 1124, 1128 to be executed, and can be executed by such node(including after preparing the statement and, optionally, creating aquery execution plan).

In the example scenarios of FIGS. 11A and 11B, and as describedelsewhere in the present disclosure, an updated prepared statement(e.g., for a query) is described as being sent to the database client,and then the database client sending the updated prepared statement to adatabase node for execution (where the statement is then executed,including after generating a prepared statement 1056, and possibly aquery plan 1064 for that particular node). In other aspects, the updatedprepared statement can be sent from the node re-preparing the statementto a database node specified in the updated prepared statement ascapable of executing the prepared statement. The updated preparedstatement can also be sent to the database client by the database nodeperforming the re-preparation of the statement, or can be sent to thedatabase client along with statement execution results by the executingnode.

EXAMPLE 9 Routing of Queries to Source Node on Replica Node Failure

FIG. 12 illustrates operations 1200 occurring at a database client 1204,a source node 1208, a first replica node 1212, and a second replica node1216, having respective execution timelines 1206, 1210, 1214, 1218,during an example scenario for statement (or query) routing when thestatus of a replica node is changed. In particular, the operations 1200illustrate a scenario where statements are routed to the source node1208 when a replica node 1212, 1216 is fully or partially unavailable.

The second replica node 1216 experiences a full or partial failure at1222. The failure is detected by the source node 1208 and the firstreplica node 1212 at 1226. Although shown as occurring concurrently, inat least some cases, the failure of the second node 1216 can be detectedby the source node 1208 and the first replica node 1212 at differenttimes. When the failure of the second replica node 1216 is detected, thesource node 1208 and the first replica node 1212 increment a metadataidentifier, such as a timestamp, at 1230. At 1234, the source node 1208and the first replica node 1212 update a list of active nodes.

The source node 1204 sends a communication 1238 to the database client1204 to update a list of active nodes maintained by the database client.The database client 1204 updates its list of active nodes at 1242. Theoperations 1200 can carried out differently in some aspects. Forinstance, rather than the communication 1238 being sent by the sourcenode 1208, it can be sent by the first replica node 1212. Or, operations1200 can omit the communication 1238, such as if the database client1204 directly determines that the second replica node 1216 isunavailable (such as by detecting that a network connection with thesecond replica node has been terminated or is unavailable).

The database client 1204 requests that a statement be prepared (e.g.,for a query), or a previously prepared statement be executed, at 1246.The request is sent in a communication 1250 to one of the availablenodes in the system. In the case of a prepared statement, if theprepared statement can be directed to a node that is active and capableof executing the prepared statement, it is sent to such node. If such anode is not available, the request to execute the prepared statement canbe sent to any active node.

As shown, the communication 1250 is received by the first replica node1212 at 1254. At 1258, if the request of communication 1250 is toprepare a statement, the statement is prepared indicating that thestatement should be executed at the source node 1208. If the request ofcommunication 1250 is to execute the prepared statement, an identifierassociated with the prepared statement is examined The identifier isdetermined to be older (such as having a lower integer value) that theincremented identifier resulting from 1230. Rather than executing theprepared statement, the first replica node 1212 re-prepares thestatement at 1258 to indicate that the prepared statement should beexecuted at the source node 1208. The prepared, or re-prepared,statement is sent from the first replica node 1212 to the databaseclient 1204 in communication 1262. In other implementations, thecommunication 1250 can be sent to the source node 1208, which can carryout preparation/re-preparation at 1258 and send the communication 1262.

The database client 1204 issues a request to execute the preparedstatement at 1266, which is sent to the source node 1208 incommunication 1270. The source node 1208 executes the prepared statementat 1274.

FIG. 13 illustrates operations 1300 occurring at a database client 1304,a source node 1308, a first replica node 1312, and a second replica node1316, having respective execution timelines 1306, 1310, 1314, 1318, ifthe second replica node becomes available to process prepared statement.At 1320, the second replica node 1316 recovers from a crash or failuresituation, or otherwise becomes available to process preparedstatements. The recovery is detected by the source node 1308 and thefirst replica node 1312 at 1324. The source node 1308 and the firstreplica node 1312 update their identifiers, such as a metadatatimestamp, at 1328. The source node 1308 and the first replica node 1312update their list of active nodes at 1332. The source node 1308 can senda communication 1336 to update the list of active nodes at the databaseclient 1304. The database client 1304 updates its list of active nodesat 1340. Alternatively, the database client 1304 determines that thesecond replica node 1316 is available in another manner, such asreceiving the communication 1336 from the first replica node 1308 ordirectly detecting that the second replica node has become available.

At 1344, the database client 1304 requests that a prepared statement beexecuted or, a statement be prepared, and sends the request in acommunication 1348. The communication 1348 is received by the firstreplica node 1312 at 1352. Alternatively, the communication 1348 couldbe received, and subsequent actions performed, by the source node 1308or the second replica node 1316. At 1356, the first replica node 1312prepares or re-prepares the statement (e.g., after determining that aprepared statement is associated with a version timestamp that is lessthan the value of the identifier produced by 1328) using the list ofcurrently available nodes, including the second replica node 1316. Theprepared or re-prepared statement is sent to the database client 1304 incommunication 1360. At 1364, the database client 1304 sends the preparedstatement for execution at 1372 in communication 1368. The communication1368 can be sent to, and the execution 1372 performed by, the sourcenode 1308, the first replica node 1312, or the second replica node 1316.Prior to execution, the node to which the communication 1368 is sent canprepare the statement and, optionally, a query execution plan.

EXAMPLE 10 Routing Queries to Available Replica Nodes on Replica NodeAvailability Change

FIG. 14 illustrates operations 1400 occurring at a database client 1404,a source node 1408, a first replica node 1412, and a second replica node1416, having respective execution timelines 1406, 1410, 1414, 1418,during an example scenario for query routing (or statement routing, orquery routing using prepared statement) when the status of a replicanode is changed. In particular, the operations 1400 illustrate ascenario where prepared statements are routed to any available node1408, 1412, 1416 when a replica node 1412, 1416 becomes fully orpartially unavailable, or when a replica node becomes available again.

The second replica node 1416 becomes unavailable (e.g., crashes,deadlocks, experiences a network error) or becomes available (e.g.,recovers from a crash, network error, or deadlock) at 1420. The failureor recovery is detected by the source node 1408 and the first replicanode 1412 at 1424. The source node 1408 and the first replica node 1412update an identifier (e.g., by incrementing an integer value), such as ametadata timestamp, at 1428. In some cases, the identifiers can beupdated independently, in other cases a node, such as the source node1408, can direct another node, such as the first replica node 1412, toupdate the identifier.

The source node 1408 and the first replica node 1412 update a list ofactive nodes at 1432. For example, if a failure of the second replicanode 1416 was detected, the source node 1408 and the first replica node1412 can remove the second replica node from the list of active nodes at1432. If a recovery of the second replica node 1416 was detected, thesource node 1408 and the first replica node 1412 can add the secondreplica node to the list of active nodes at 1432. Although the actionsat 1424, 1428, and 1432 are shown as occurring concurrently at thesource node 1408 and the first replica node 1412, in some aspects, oneor more of these actions can occur at a different times at the sourcenode than at the first replica node.

The source node 1408 sends a communication 1436 to update a list ofavailable nodes maintained at the database client 1404 to the databaseclient. The database client 1404 updates its list of available nodes at1440. In other cases, the communication 1436 is sent by the firstreplica node 1412, or, rather than performing the update at 1440 basedon the communication 1436, the database client 1404 updates the list ofavailable nodes in another manner, such as by directly detecting thatthe availability status of the second replica node 1416 has changed(e.g., by a network connection being broken or established between thedatabase client and the second replica node).

At 1444, the database client 1404 requests that a statement be prepared,or a previously prepared statement be executed. The request is sent tothe first replica node 1412 in communication 1448. However, the requestcan be sent to, and subsequent processing carried out by, any availablenode (e.g., in the example shown, the source node 1408 or the firstreplica node 1412). The first replica node 1412 receives thecommunication 1448 at 1452.

If the request is to prepare the statement, the first replica node 1412prepares the statement using its list of currently active nodes. If therequest is to execute a prepared statement, the first replica node 1412determines that the prepared statement is associated with an identifier(e.g., a version timestamp) that is out of date (e.g., has a lowervalue) than an identifier, such as a metadata timestamp, maintained bythe first replica node. The first replica node 1412 re-prepares thestatement at 1456 using its list of currently active available nodes.When a statement is re-prepared, the updated prepared statement canremove a node as compared with a previous version (e.g., when the secondreplica node 1416 has become unavailable) or add a node as compared witha previous version (e.g., when the second replica node has becomeavailable). The prepared statement/updated prepared statement is sent tothe database client 1404 by the first replica node 1412 in communication1460.

At 1464, the database client 1404 sends the prepared statement to beexecuted. The request is sent in communication 1468. The communication1468 can be sent to any available node indicated in the preparedstatement. In the case of a prepared statement made when the secondreplica node 1416 become unavailable, the communication 1468 can be sentto the source node 1408 or the first replica node 1412. In the case of aprepared statement made when the second replica node 1416 becameavailable, the communication 1468 can be sent to the source node 1408,the first replica node 1412, or the second replica node 1416. Theprepared statement is executed by a node 1408, 1412, 1416 to which thecommunication 1468 was sent at 1472. Prior to executing the preparedstatement, the node 1408, 1412, 1416 is sent can prepare the statementand, optionally generate a query execution plan.

EXAMPLE 11 Prepared Statement/Query Routing Based on Table AvailabilityStatus at Replica Nodes

FIG. 15 illustrates operations 1500 occurring at a database client 1504,a source node 1508, a first replica node 1512, and a second replica node1516, having respective execution timelines 1506, 1510, 1514, 1518,during an example scenario for prepared statement routing (including forquery routing) when the status of a replica node changes. In particular,the operations 1500 illustrate a scenario where prepared statements arerouted to any available node 1508, 1512, 1516 replicating the accessedtables when a replica node 1512, 1516 replicating the accessed tablesbecomes fully or partially unavailable, or when such a replica nodebecomes available again.

The second replica node 1516 becomes unavailable (e.g., crashes,deadlocks, experiences a network error) or becomes available (e.g.,recovers from a crash, network error, or deadlock) at 1520. In thisExample, the failure, and subsequent recovery, can affect only a portionof the data (e.g., particular tables or records) replicated at thesecond replica node 1516. For instance, if the second replica node 1516replicates tables T1-T4, the failure may affect only T1. Such a failurecan be caused, for example, by a deadlock, an error with a particularnetwork connection, or a memory or storage failure that affects lessthan all of the replicated data.

The failure or recovery is detected by the source node 1508 and thefirst replica node 1512 at 1524. The source node 1508 and the firstreplica node 1512 update an identifier (e.g., by incrementing an integervalue), such as a metadata timestamp, at 1528. In some cases, theidentifiers can be updated independently, in other cases a node, such asthe source node 1508, can direct another node, such as the first replicanode 1512, to update the identifier.

The source node 1508 and the first replica node 1512 update thereplication status of replicated tables at 1532. For example, if afailure is detected that affects replicated table T1 of the secondreplica node 1516, but not replicated tables T2-T4, the source node 1508and the first replica node 1512 can update the replication status of thereplicated tables to indicate that the second replica node 1516 is notavailable to service requests for T1, but remains available to servicerequests for T2-T4. If a recovery of the second replica node 1516 wasdetected that makes T1 available again at the second replica node, thesource node 1508 and the first replica node 1512 can update thatreplication status of the replicate tables to indicate that tables T1-T4are available at the second replica node.

Although the actions at 1524, 1528, and 1532 are shown as occurringconcurrently at the source node 1508 and the first replica node 1512, insome aspects, one or more of these actions can occur at a different timeat the source node than at the first replica node. In particular, areplication failure, or recovery, at the second replica node 1516 mayinitially be detected by the source node 1508 (e.g., because the sourcenode detected a failure in a commit process for replication of atransaction involving the second replica node). The source node 1508 cancommunicate this status change to the first replica node 1512, includingby sending an updated table replication status to the first replicanode. An analogous process can occur if the source node 1508 determinesthat T1 is accessible again at the second replica node 1516 following afailure.

The source node 1508 sends a communication 1536 to update a list ofavailable nodes maintained at the database client 1504 to the databaseclient. The database client 1504 updates its list of available nodes at1540. In other cases, the communication is sent by the first replicanode 1512, or, rather than performing the update at 1540 based on thecommunication 1536, the database client 1504 updates the list ofavailable nodes in another manner, such as by directly detecting thatthe availability status of the second replica node 1516 has changed(e.g., by a network connection being broken or established between thedatabase client and the second replica node).

At 1544, the database client 1504 requests that a statement be prepared,or a previously prepared statement be executed. The request is sent tothe first replica node 1508 in communication 1548. In the case of astatement to be prepared, the request can be sent to, and subsequentprocessing carried out by, any available node (e.g., in the exampleshown, the source node 1508, the first replica node 1512, or the secondreplica node 1516), even if the node does not replicate tables needed bythe statement. In the case of a prepared statement to be executed, therequest can be sent to, and subsequent processing carried out by, anynode indicated in the prepared statement (which could be one or more ofthe source node 1508, the first replica node 1512, and the secondreplica node 1516, depending on the status of the database system whenthe statement was originally prepared).

The first replica node 1512 receives the communication 1548 at 1552. Ifthe request is to prepare the statement, the first replica node 1512prepares the statement using its current table replication statusinformation. If the request is to execute a prepared statement, thefirst replica node 1512 determines that the prepared statement isassociated with an identifier (e.g., a version timestamp) that is out ofdate (e.g., has a lower value) than an identifier, such as a metadatatimestamp, maintained by the first replica node. In one aspect, thefirst replica node 1512 re-prepares the statement at 1556 using itscurrent table replication status information. When a statement isre-prepared, the updated prepared statement can remove a node ascompared with a previous version (e.g., when a needed table at thesecond replica node 1516 has become unavailable), add a node as comparedwith a previous version (e.g., when the needed replicated table hasbecome available at the second replica node), or can remain unchanged(e.g., when the second replica node changed status, but the statuschange did not affect a table needed for the prepared statement).

In another aspect, rather than always repreparing a statement if aversion timestamp associated with the prepared statement is out of datewith respect to an identifier of the first replica node 1512, theprepared statement can be analyzed to determine whether it accesses atable whose status has changed on the second replica node 1516. In somecases, version information can be maintained for each table, andassociated with a prepared statement, such that a prepared statementonly need be re-prepared if it involves a table having a changed version(e.g., whose metadata timestamp was incremented in the replicationstatus information at 1528). If the prepared statement does not involvea changed version, the prepared statement can be executed at 1560.

If a statement was prepared, the prepared/re-prepared statement is sentto the database client 1504 by the first replica node 1512 incommunication 1564. At 1568, the database client 1504 sends the preparedstatement to be executed. The request is sent in communication 1572. Thecommunication can be sent to any available node indicated in theprepared statement. In the case of a prepared statement created when anaccessed table became unavailable at the second replica node 1516, thecommunication 1572 can be sent to the source node 1508 or the firstreplica node 1512. In the case of a prepared statement created when anaccessed table became available at the second replica node 1516, thecommunication 1572 can be sent to the source node 1508, the firstreplica node 1512, or the second replica node 1516. The preparedstatement is executed by a node 1508, 1512, 1516 to which thecommunication 1572 was sent at 1576. Prior to executing the preparedstatement, the node 1508, 1512, 1516 to which the communication 1572 wassent can prepare the statement, and, optionally, create a queryexecution plan.

EXAMPLE 12 Interaction of Replication Processing and Node AvailabilityUpdate Process

As discussed, in at least some aspects, a database client can sendprepared statement to a source node or a replica node while data isbeing replicated in a replicated database system. Depending on theprotocol used for replication (e.g., synchronous replication, optimisticsynchronous replication, asynchronous replication), a prepared statement(e.g., for a query) may return different results depending on which nodeit is executed (e.g., whether it is executed at the source node, areplica node where recent data has been replicated, or a replica nodewhere recent data has not been replicated).

In prior database systems, replication is typically suspended if one ofthe replica nodes becomes unavailable. In addition to allowing queriesto be processed when an error occurs at a replica node, either by thesource node, or by the source node or an available replica node, thedisclosed innovations can allow replication to continue even if areplica node becomes fully or partially unavailable. In some cases,replication is completely stopped to the failed replica node. In othercases, if the replica node has only partially failed, replication can becontinued for data that remains accessible at the replica node.

FIG. 16 illustrates operations 1600 occurring at a source node 1604,which also serves as a transaction master and coordinates (to a degreedepending on the commit/replication protocol used) the commit ofreplicated transactions at a first replica (or transaction slave) node1608, a second replica (or transaction slave) node 1612, and a thirdreplica (or transaction slave) node 1616, having respective executiontimelines 1606, 1610, 1614, 1618.

The source node 1604 starts commit processing of replicated databaseoperations (e.g., a replicated transaction) at 1622. Thecommit/replication protocol may be a protocol described in the presentdisclosure, a variant of a commit/replication protocol described in thepresent disclosure, or another commit/replication protocol. The thirdreplica node 1616 experiences a failure, which can be a full failure ora partial failure (e.g., affecting only particular replicated tables orrecords) at 1626. The failure of the third replica node 1616 is detectedby the source node 1604, the first replica node 1608, and the secondreplica node 1612.

The nodes 1604, 1608, 1612 update a list of available nodes at 1630. Insome aspects, updating the list of available nodes can include changingthe status of the second replica node 1616 to inactive. In otheraspects, updating the list of available nodes can include marking onlycertain data, such as particular records or tables of the third replicanode 1616, as inactive. The nodes 1604, 1608, 1612 increment anidentifier, such as a metadata identifier than can be used to invalidateprepared statements that may be stored at a database client, at 1634.Incrementing the identifier at 1634 is shown as a synchronous process.If desired, updating the list of available nodes at 1630 may be madesynchronous instead of, or in addition to the, incrementing theidentifier at 1634. Or, both 1630 and 1634 can be asynchronous. However,the nodes 1604, 1608, 1612 all carry out 1630 and 1634 before the sourcenode commits the transaction at 1638 (e.g., prior to the synchronizationstep 950 of FIG. 9 ). The transaction is committed at the replica node1608, 1612 at 1642. The commit 1642 is shown as occurringasynchronously, however, the commit could occur synchronously, in otherimplementations.

Thus, as shown in FIG. 16 , the commit operation is paused to allow thesystem to be updated to reflect that the third replica node 1616 isunavailable, so that an error is not encountered during the commitprocess. Although FIG. 16 is described with respect to failure of areplica node, an analogous process can occur on recovery of a replicanode.

EXAMPLE 13 Example Database Node Operations for Adaptive PreparedStatement/Query Routing

FIG. 17 is a flowchart of example operations 1700 occurring at adatabase system node in a replicated database environment when a changeis detected in the availability status of a replica node in the databasesystem. At 1710, the database system node determines that theavailability status of the replica node has changed. The database systemnode receives a prepared statement from a database client at 1720. Theprepared statement specifies one or more nodes useable to execute theprepared statement. At 1730, the database system node updates theprepared statement (e.g., by repreparing the statement). The updatedprepared statement includes a database system node that was not includedin the prepared statement (e.g., if the replica node became available),or does not include a database system node that was in the preparedstatement (e.g., if the replica node became unavailable). The updatedprepared statement is sent to the database client at 1740.

EXAMPLE 14 Example Database Client Operations During Adaptive PreparedStatement/Query Routing

FIG. 18 is a flowchart of example operations 1800 occurring at adatabase client in communication with a replicated database systemhaving a plurality of nodes. At 1810, the database client sends arequest to a database system node to prepare a statement. The databaseclient receives the prepared statement at 1820. The prepared statementspecifies a plurality of database system nodes on which the preparedstatement is executable. At 1830, the database client sends the preparedstatement to one of the specified database system nodes. In response tothe sending, at 1840, the database client receives an updated preparedstatement (e.g., a re-prepared statement). The updated preparedstatement specifies one or more nodes on which the updated preparedstatement is executable. The nodes on which the updated preparedstatement is executable includes a node that was not included in theprepared statement, or omits a node that was specified in the preparedstatement.

EXAMPLE 15 Example Database Node Operations for Adaptive PreparedStatement/Query Routing Using Metadata Identifiers

FIG. 19 is a flowchart of example operations 1900 occurring at adatabase system node in a replicated database environment having atleast one replica node when there is a change in the availability statusof the at least one replica node. At 1910, it is determined that theavailability status of the at least one replica node has changed, suchas the at least one replica node becoming unavailable, or becomingavailable after previously being unavailable. The change in availabilitystatus is recorded in a data store at 1920, such as by making ormodifying an entry in a table, list, file, or other data structure.

A metadata identifier is updated at 1930, such as by incrementing aninteger value. At 1940, a prepared statement is received at the databasesystem node, such as from a database client. The prepared statement isassociated with a version timestamp (which may be stored on the databasesystem node). At 1950 the updated metadata identifier is compared withthe version timestamp of the prepared statement. It is determined, at1960, that the prepared statement should be updated. For instance, thecomparing may indicate that the version timestamp is out of date, andthat there may be a change in the database system (e.g., in theavailability of nodes of the database system) that may affect theexecution of the prepared statement. At 1970, the prepared statement isupdated using node availability information of the data store. Theupdated prepared statement is sent to the database client at 1980.

EXAMPLE 16 Maintaining Cross-Table Transactional Consistency onRe-Activation of Table Replication

Certain Examples of the present disclosure can involve synchronizing areplica system with a source system after replication, such assynchronous table replication with optimistic commit at a replica node,as described in Example 6, has been activated or reactivated. Forexample, in some situations, table replication may be manuallydeactivated (such as to perform maintenance) and subsequentlyreactivated, or may be restarted due to an exception occurring duringtable replication.

FIG. 20 illustrates a potential problem that can develop if tables areallowed to re-activate incrementally on a table-by-table basis. FIG. 20illustrates a system 2000 having a source system 2010 that containsTables 1 and 2 and a replica system 2020 that contains copies of Tables1 and 2, which are being incrementally synchronized. In the sourcesystem 2010, changes to Table 1 and Table 2 have accumulated aftersynchronization was deactivated. Replica system 2020 shows that thesynchronizer for Table 1 has finished committing the changes to Table1′, but the synchronizer for Table 2′ is still working. If replicasystem 2020 is accessed at this point, a join operation between Table 1′and Table 2′ can return inconsistent data (compared to the same joinoperation between Table 1 and Table 2 at the source system 2010).

FIG. 21A provides a flowchart of an example method 2100 for assisting inmaintaining consistency in read operations received by a replica systemduring resynchronization following activation or reactivation of tablereplication. In step 2110, replication log replay, such as the processesdescribed in Examples 1-6, is blocked. In a particular implementation,log entries continue to be generated by the source system, and may besent to the replica system, even though the log entries are blocked frombeing replayed by the replica system.

To address this problem of potential inconsistencies during areactivation period, the source system and the replica system canreactivate tables with a single internal transaction. In this way, thechanges applied during reactivation can become visible at the same time,for all of the replicated tables.

In a parallel, multi-threaded process, each table in the source node islocked in step 2115. In step 2120, in a parallel, multi-threadedprocess, replication log generation is reactivated at each source table.The source tables are unlocked in step 2125, in a parallel,multi-threaded process. A snapshot timestamp is acquired in step 2130.The order of steps 2125 and 2130 may be reversed in some implementationsof the method 2100.

In step 2135, the replica tables are selectively synchronized with thesource tables. As described above, during this process, replica logs maybe generated by the source node(s) and, if desired, sent to theappropriate replica node(s). However, the replica logs are not yetreplayed.

Synchronization may be carried out in any suitable manner In onespecific example, synchronization is carried out by comparing therow-IDs values (as described in Example 4) of each source table and itsreplica table. If a row-ID value is present in the source table, but notin the replica table, the record is copied to the replica table. If therow-ID value is present in the replica table, but not in the sourcetable, the record having that row-ID value is removed from the replicatable. If the row-ID value is present in the source table and thereplica table, no action is taken. Synchronization is carried out usingthe timestamp acquired in step 2130 (e.g., using the timestamp to selectwhich transactions to ignore for replication log replay, and insteadrecover using synchronization). Thus, for example, records aresynchronized between the copies of the tables (replica tables) and thesource tables for any transaction having a transaction commit timestampnot later than the synchronization timestamp.

In step 2140, the resumption of replication log replay is initiated atthe source host for the copies of the replicated database tables. Invarious implementations, initiation is carried out by the source system,the replica system, or another system in communication with the replicasystem.

During replication log replay, the log entry (write logs and transactioncommit logs) is only replayed if the timestamp of the operation occurredlater than the synchronization timestamp acquired in step 2125.Advantageously, this can help prevent transactions from being carriedout multiple times, or missed logs being played even though thesynchronization process already made appropriate changes to thereplicated table.

FIG. 21B provides a method 2150 of synchronization operationsimplemented at least in part by the replica host. In step 2155, thereplica host receives a synchronization timestamp. The copies of thedatabase tables replicated at the replica host are selectivelysynchronized with the source database tables, based at least in part onthe synchronization timestamp, in step 2160. In step 2165, replicationlog replay is resumed at the replica host, based at least in part on thesynchronization timestamp. For example, the replica host executes anentry of a DML replayer log for any entry having an update timestamp notearlier than the synchronization timestamp or having a correspondingtransaction commit timestamp later than the synchronization timestamp.The replica host can also execute any entry of a transaction log for anytransaction commit timestamp later than the synchronization timestamp.

As described in method 2150, replica log replay is blocked for thereplicated tables until the synchronization process is complete. In atleast one implementation, during synchronization, the replicated tablesmay still receive read requests while synchronization is being carriedout. However, the read requests will see the unsynchronized version ofthe tables, so join operations on different tables will still operate ontable versions that are consistent with one another (although they maybe out of date compared with data available in the source tables). Oncesynchronization is complete, join operations will be able to access thesynchronized versions of the tables.

FIG. 22 provides a diagram of a system 2200 illustrating DML andtransaction log queues 2205, 2210 of a replica node illustrating how themethod 2100 of FIG. 21A can assist in avoiding multiple log replay orreplay of missed logs. The DML log queue 2205 is shown with multiple DMLstatements 2220, 2230, 2240, 2250 and the transaction log queue is shownwith multiple transaction commit operations 2225, 2235, 2245, 2255. InFIG. 22 , the arrows indicate relations between write operations andtheir corresponding transaction commit operations.

In this example, replica and source tables were synchronized with atimestamp 2215 of 11. In one aspect of a method of using the system 2200of FIG. 22 , write operations are replayed if the associated timestampis greater than or equal to the synchronization timestamp 2215, as thosestatements will have occurred after synchronization completed. Writeoperations are also replayed if the timestamp of the commit operation isgreater than the synchronization timestamp 2215, even if the timestampof the write operation itself is less than the synchronizationtimestamp. Note that, in example implementations, the timestamp of awrite operation is always less than the timestamp of its correspondingtransaction commit operation.

Write operations 2220 and 2230 will not be replayed since their writetimestamps are less than 11 and their commit timestamp is not greaterthan 11. Write operation 2240 will be replayed even though its writetimestamp is less than 11, because the timestamp of its commit operation2245 is greater than 11. Write operation 2250 will be replayed since itswrite timestamp is greater than 11. Transaction commit operations arereplayed if their timestamps are greater than the synchronizationtimestamp. In the example of FIG. 22 , transaction commit operations forTX entry 2245 and TX 2255 are replayed.

In a specific implementation, if the timestamp of the write operation isless than the synchronization timestamp, the write operation is helduntil the corresponding commit log is received and analyzed. Asdescribed above, if the timestamp of the commit operation is less thanthe synchronization timestamp, the write operation is not replayed. Thewrite operation is replayed if the commit timestamp is greater than thesynchronization timestamp.

In this way, transactions are divided by the synchronizing timestamp.Some updates (earlier updates), are replication by synchronization,while other updates (later updates, or updates from around the time thesynchronization timestamp is acquired) are replicated by playback of thereplication log. Missed transactions and double playback of transactionsare avoided. Further, since the synchronization timestamp in effectdefines a single internal transaction, readers see a consistent view oftables (all updated or all not updated).

EXAMPLE 17 Alternative Scenarios

In many of the examples described above, a single source node replicatesa database table with a single replica node. More generally, theprotocols described herein can be used for 1-to-n replication between asource node and n replica nodes, where n is 2 or more, each of the nreplica nodes storing a copy (replica) of the database table. In someimplementations, n is 20, 50, 100, or more nodes. The protocol can alsobe used for n-to-1 replication, where at least a portion of adistributed source system (such as one or more selected tables, orportions thereof) has multiple source nodes and is replicated to asingle replica node. The protocol can also be used with m-n replication,where at least part of a distributed source system (such as one or moreselected tables, or portions thereof) are replicated to multiple replicanodes.

In many of the examples described above, a database table is replicatedbetween a source node and replica node. As noted, term database tableindicates any portion of a database, however organized. As such, theprotocols describes herein can be used for system (database-wide)replication, where the “database table” is in effect the entire databasesystem. Similarly, when the “database table” is a defined section of theentire database system, e.g., one of multiple tables in the databasesystem, the protocols can be applied on a table-by-table basis. In thiscontext, table replication can be selectively applied on atable-by-table basis, such that some tables are replicated while othersare not replicated.

In further implementations, the database table may be partitioned, suchas being partitioned among multiple source nodes, multiple replicanodes, or multiple source nodes and multiple replica nodes. In somecases, one or both of the source node and the replica node hold apartition of the table, with the other holding the entire table. Inother cases, both the source and replica hold partitions of the table,which partitions may be the same or different.

In many of the examples describes above, a source node replicates datawith a replica node. The terms “source node” and “replica node” denoteroles in the table replication process. Depending on configuration, agiven node may be a source node for some table replication operations(e.g., for a first table or set of tables) and a replica node for othertable replication operations (e.g., for a second table or set oftables).

EXAMPLE 18 Computing Systems

FIG. 23 depicts a generalized example of a suitable computing system2300 in which the described innovations may be implemented. Thecomputing system 2300 is not intended to suggest any limitation as toscope of use or functionality of the present disclosure, as theinnovations may be implemented in diverse general-purpose orspecial-purpose computing systems.

With reference to FIG. 23 , the computing system 2300 includes one ormore processing units 2310, 2315 and memory 2320, 2325. In FIG. 23 ,this basic configuration 2330 is included within a dashed line. Theprocessing units 2310, 2315 execute computer-executable instructions. Aprocessing unit can be a general-purpose central processing unit (CPU),processor in an application-specific integrated circuit (ASIC), or anyother type of processor. In a multi-processing system, multipleprocessing units execute computer-executable instructions to increaseprocessing power. For example, FIG. 23 shows a central processing unit2310 as well as a graphics processing unit or co-processing unit 2315.The tangible memory 2320, 2325 may be volatile memory (e.g., registers,cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory,etc.), or some combination of the two, accessible by the processingunit(s). The memory 2320, 2325 stores software 2380 implementing one ormore innovations described herein, in the form of computer-executableinstructions suitable for execution by the processing unit(s) 2310,2315.

A computing system 2300 may have additional features. For example, thecomputing system 2300 includes storage 2340, one or more input devices2350, one or more output devices 2360, and one or more communicationconnections 2370. An interconnection mechanism (not shown) such as abus, controller, or network interconnects the components of thecomputing system 2300. Typically, operating system software (not shown)provides an operating environment for other software executing in thecomputing system 2300, and coordinates activities of the components ofthe computing system 2300.

The tangible storage 2340 may be removable or non-removable, andincludes magnetic disks, magnetic tapes or cassettes, CD-ROMs, DVDs, orany other medium which can be used to store information in anon-transitory way and which can be accessed within the computing system2300. The storage 2340 stores instructions for the software 2380implementing one or more innovations described herein.

The input device(s) 2350 may be a touch input device such as a keyboard,mouse, pen, or trackball, a voice input device, a scanning device, oranother device that provides input to the computing system 2300. Theoutput device(s) 2360 may be a display, printer, speaker, CD-writer, oranother device that provides output from the computing system 2300.

The communication connection(s) 2370 enable communication over acommunication medium to another computing entity. The communicationmedium conveys information such as computer-executable instructions,audio or video input or output, or other data in a modulated datasignal. A modulated data signal is a signal that has one or more of itscharacteristics set or changed in such a manner as to encode informationin the signal. By way of example, and not limitation, communicationmedia can use an electrical, optical, RF, or other carrier.

The innovations can be described in the general context ofcomputer-executable instructions, such as those included in programmodules, being executed in a computing system on a target real orvirtual processor. Generally, program modules include routines,programs, libraries, objects, classes, components, data structures, etc.that perform particular tasks or implement particular abstract datatypes. The functionality of the program modules may be combined or splitbetween program modules as desired in various embodiments.Computer-executable instructions for program modules may be executedwithin a local or distributed computing system.

The terms “system” and “device” are used interchangeably herein. Unlessthe context clearly indicates otherwise, neither term implies anylimitation on a type of computing system or computing device. Ingeneral, a computing system or computing device can be local ordistributed, and can include any combination of special-purpose hardwareand/or general-purpose hardware with software implementing thefunctionality described herein.

In various examples described herein, a module (e.g., component orengine) can be “coded” to perform certain operations or provide certainfunctionality, indicating that computer-executable instructions for themodule can be executed to perform such operations, cause such operationsto be performed, or to otherwise provide such functionality. Althoughfunctionality described with respect to a software component, module, orengine can be carried out as a discrete software unit (e.g., program,function, class method), it need not be implemented as a discrete unit.That is, the functionality can be incorporated into a larger or moregeneral purpose program, such as one or more lines of code in a largeror general purpose program.

For the sake of presentation, the detailed description uses terms like“determine” and “use” to describe computer operations in a computingsystem. These terms are high-level abstractions for operations performedby a computer, and should not be confused with acts performed by a humanbeing. The actual computer operations corresponding to these terms varydepending on implementation.

EXAMPLE 19 Cloud Computing Environment

FIG. 24 depicts an example cloud computing environment 2400 in which thedescribed technologies can be implemented. The cloud computingenvironment 2400 comprises cloud computing services 2410. The cloudcomputing services 2410 can comprise various types of cloud computingresources, such as computer servers, data storage repositories,networking resources, etc. The cloud computing services 2410 can becentrally located (e.g., provided by a data center of a business ororganization) or distributed (e.g., provided by various computingresources located at different locations, such as different data centersand/or located in different cities or countries).

The cloud computing services 2410 are utilized by various types ofcomputing devices (e.g., client computing devices), such as computingdevices 2420, 2422, and 2424. For example, the computing devices (e.g.,2420, 2422, and 2424) can be computers (e.g., desktop or laptopcomputers), mobile devices (e.g., tablet computers or smart phones), orother types of computing devices. For example, the computing devices(e.g., 2420, 2422, and 2424) can utilize the cloud computing services2410 to perform computing operations (e.g., data processing, datastorage, and the like).

EXAMPLE 20 Implementations

Although the operations of some of the disclosed methods are describedin a particular, sequential order for convenient presentation, it shouldbe understood that this manner of description encompasses rearrangement,unless a particular ordering is required by specific language set forthbelow. For example, operations described sequentially may in some casesbe rearranged or performed concurrently. Moreover, for the sake ofsimplicity, the attached figures may not show the various ways in whichthe disclosed methods can be used in conjunction with other methods.

Any of the disclosed methods can be implemented as computer-executableinstructions or a computer program product stored on one or morecomputer-readable storage media and executed on a computing device(e.g., any available computing device, including smart phones or othermobile devices that include computing hardware). Tangiblecomputer-readable storage media are any available tangible media thatcan be accessed within a computing environment (e.g., one or moreoptical media discs such as DVD or CD, volatile memory components (suchas DRAM or SRAM), or nonvolatile memory components (such as flash memoryor hard drives)). By way of example and with reference to FIG. 23 ,computer-readable storage media include memory 2320 and 2325, andstorage 2340. The term computer-readable storage media does not includesignals and carrier waves. In addition, the term computer-readablestorage media does not include communication connections (e.g., 2370).

Any of the computer-executable instructions for implementing thedisclosed techniques as well as any data created and used duringimplementation of the disclosed embodiments can be stored on one or morecomputer-readable storage media. The computer-executable instructionscan be part of, for example, a dedicated software application or asoftware application that is accessed or downloaded via a web browser orother software application (such as a remote computing application).Such software can be executed, for example, on a single local computer(e.g., any suitable commercially available computer) or in a networkenvironment (e.g., via the Internet, a wide-area network, a local-areanetwork, a client-server network (such as a cloud computing network), orother such network) using one or more network computers.

For clarity, only certain selected aspects of the software-basedimplementations are described. Other details that are well known in theart are omitted. For example, it should be understood that the disclosedtechnology is not limited to any specific computer language or program.For instance, the disclosed technology can be implemented by softwarewritten in C++, Java, Perl, JavaScript, Python, Ruby, ABAP, SQL, AdobeFlash, or any other suitable programming language, or, in some examples,markup languages such as html or XML, or combinations of suitableprogramming languages and markup languages. Likewise, the disclosedtechnology is not limited to any particular computer or type ofhardware. Certain details of suitable computers and hardware are wellknown and need not be set forth in detail in this disclosure.

Furthermore, any of the software-based embodiments (comprising, forexample, computer-executable instructions for causing a computer toperform any of the disclosed methods) can be uploaded, downloaded, orremotely accessed through a suitable communication means. Such suitablecommunication means include, for example, the Internet, the World WideWeb, an intranet, software applications, cable (including fiber opticcable), magnetic communications, electromagnetic communications(including RF, microwave, and infrared communications), electroniccommunications, or other such communication means.

The disclosed methods, apparatus, and systems should not be construed aslimiting in any way. Instead, the present disclosure is directed towardall novel and nonobvious features and aspects of the various disclosedembodiments, alone and in various combinations and sub combinations withone another. The disclosed methods, apparatus, and systems are notlimited to any specific aspect or feature or combination thereof, nor dothe disclosed embodiments require that any one or more specificadvantages be present or problems be solved.

The technologies from any example can be combined with the technologiesdescribed in any one or more of the other examples. In view of the manypossible embodiments to which the principles of the disclosed technologymay be applied, it should be recognized that the illustrated embodimentsare examples of the disclosed technology and should not be taken as alimitation on the scope of the disclosed technology. Rather, the scopeof the disclosed technology includes what is covered by the scope andspirit of the following claims.

What is claimed is:
 1. A computing system comprising: at least onehardware processor; at least one memory coupled to the at least onehardware processor; and one or more computer-readable storage mediastoring computer-executable instructions that, when executed, cause thecomputing system to perform operations comprising: at a node of adatabase system comprising a plurality of nodes, the plurality of nodescomprising at least one source node and at least one replica node,receiving a prepared statement from a database client, the preparedstatement specifying one or more nodes of the database system useable toexecute the prepared statement; at the node, updating the preparedstatement, the updating comprising adding a node to the one or morenodes in the prepared statement, or removing at least one of the one ormore nodes in the prepared statement, depending on a type ofavailability status change of the replica node; and at the node, sendingthe updated prepared statement to the database client.
 2. The computingsystem of claim 1, wherein the change in status of the replica nodecomprises the replica node becoming unavailable and updating theprepared statement comprises not including the replica node in theupdated prepared statement.
 3. The computing system of claim 1, whereinthe change in status of the replica node comprises the replica nodebecoming available and updating the prepared statement comprisesincluding the replica node in the updated prepared statement.
 4. Thecomputing system of claim 1, the operations further comprising: at thenode, in response to determining that the availability status of thereplica node has changed, incrementing an identifier maintained by thenode; at the node, comparing the incremented identifier with a versiontimestamp associated with the prepared statement; and at the node,determining that the version timestamp identifier is associated with anearlier state of the database system than a state of the database systemassociated with the incremented identifier; wherein the updating iscarried out in response to determining that the version timestampidentifier is associated with an earlier state of the database system.5. The computing system of claim 1, wherein the change in status of thereplica node comprises the replica node being unavailable and updatingthe prepared statement comprises specifying that the prepared statementshould be executed at the source database system node.
 6. The computingsystem of claim 1, wherein the change in status of the replica nodecomprises the replica node being unavailable, the replica node is afirst replica node, and updating the prepared statement comprisesspecifying that the updated prepared statement may be executed at thesource database system node and at least a second replica node.
 7. Thecomputing system of claim 1, wherein determining that the availabilitystatus of the replica node has changed comprises determining that aportion of data replicated at the replica node is not available, aportion of the replicated data remains available, and updating theprepared statement comprises: at the node, determining data accessed bythe prepared statement; at the node, determining whether data accessedby the prepared statement includes the portion of data replicated at thereplica node that is not available; and at the node, when data accessedby the prepared statement is not available at the replica node, notincluding the replica node in the updated prepared statement.
 8. Thecomputing system of claim 1, wherein determining that the availabilitystatus of the replica node has changed comprises determining that aportion of data replicated at the replica node is not available, aportion of the replicated data remains available, and updating theprepared statement comprises: at the node, determining data accessed bythe prepared statement; at the node, determining whether data accessedby the prepared statement includes the portion of data replicated at thereplica node that is not available; and at the node, when data accessedby the prepared statement is available at the replica node, includingthe replica node in the updated prepared statement.
 9. The computingsystem of claim 1, the operations further comprising: updating a nodestatus store to indicate the change in status of the replica node. 10.The computing system of claim 9, wherein the node status store maintainsstatus information for at least a portion of the database system nodes,wherein each node is indicated as active or inactive, and updating theprepared statement comprising updating the prepared statement based onnodes having an active status.
 11. The computing system of claim 1,wherein the operations are performed at the source node, the replicanode is a first replica node, and the database system further comprisingat least a second replica node, the operations further comprising: atthe source node, receiving a request to commit a database transaction,the database transaction comprising one or more database operations tobe replicated at least at the at least a second replica node; at thesource node, beginning a process to commit the database transaction; atthe source node, marking the status of the first replica node asinactive; and at the source node, after marking the status of the firstreplica node as inactive, committing the transaction.
 12. The computingsystem of claim 11, the operations further comprising: at the sourcenode, receiving a communication from the at least a second replica nodethat the at least a second replica node marked the first replica node asinactive, wherein the committing occurs after receiving thecommunication.
 13. The computing system of claim 11, the operationsfurther comprising: at the source node, incrementing a first identifiermaintained by the source node; and at the source node, receiving anotification that the at least a second replica node has incremented asecond identifier; wherein the first and second identifiers are useableto invalidate prepared statements maintained by the database client andthe committing occurs after the incrementing and receiving thenotification.
 14. A computing system comprising: at least one hardwareprocessor; at least one memory coupled to the at least one hardwareprocessor; and one or more computer-readable storage media storingcomputer-executable instructions that, when executed, cause thecomputing system to perform operations comprising: at a database systemclient, sending a request to a database system node to prepare astatement, the database system node being part of a database systemcomprising a plurality of database system nodes, at least one of thedatabase system nodes being a source node and at least one of thedatabase system nodes being a replica node; at the database systemclient, receiving a prepared statement from the database system node,the prepared statement specifying at least one database system node onwhich the prepared statement is executable; at the database systemclient, sending the prepared statement to the at least one databasesystem node specified in the prepared statement; and at the databasesystem client, receiving an updated prepared statement, the updatedprepared statement specifying one or more database system nodes on whichthe updated prepared statement is executable, the one or more databasesystem nodes comprising a database system node that was not the at leastone database system node specified in the prepared statement, oromitting the at least one database system node specified in the preparedstatement.
 15. The computing system of claim 14, the operations furthercomprising: at the database system client, sending the updated preparedstatement to a database system node of the one or more database systemnodes specified in the updated prepared statement for execution; and atthe database system client, receiving execution results.
 16. A computingsystem comprising: at least one hardware processor; at least one memorycoupled to the at least one hardware processor; and one or morecomputer-readable storage media storing computer-executable instructionsthat, when executed, cause the computing system to perform operationscomprising: at a database system node of a replicated database,determining that an availability status of a replica node of areplicated database environment has changed, wherein the database systemnode stores at least one database table and the replicated databaseenvironment comprises a plurality of database system nodes, includingthe database system node and the replica node, and in communication witha database client; at the database system node, recording theavailability status change in a data store comprising availabilitystatus information for nodes of the replicated database system; at thedatabase system node, incrementing a metadata identifier; at thedatabase system node, receiving a prepared statement from the databaseclient, the prepared statement associated with a version timestamp; atthe database system node, comparing the incremented metadata identifierwith the version timestamp; at the database system node, determiningthat the prepared statement should be updated; at the database systemnode, updating the prepared statement using the availability statusinformation of the data store; and at the database system node, sendingthe updated prepared statement to the database client.
 17. The computingsystem of claim 16, wherein determining that an availability status of areplica node of the replicated database environment has changedcomprises determining at least one replicated table that is notaccessible at the replica node and recording the availability statuschange in the data store comprises recording that the at least onereplicated table is not available at the replica node.
 18. The computingsystem of claim 17, wherein, after the recording, the data storecomprises at least one replicated table that is accessible at thereplica node.
 19. The computing system of claim 18, wherein updating theprepared statement comprises comparing tables accessed by the preparedstatement with accessible tables recorded in the data store.
 20. Thecomputing system of claim 16, the operations further comprising: at thedatabase system node, associating the incremented metadata identifierwith the updated prepared statement.
 21. One or more computer-readablestorage media comprising: computer-executable instructions that, whenexecuted by a computing system comprising at least hardware processorand at least one memory coupled to the at least one hardware processor,cause the computing system to, at a node of a database system comprisinga plurality of nodes, the plurality of nodes comprising at least onesource node and at least one replica node, receive a prepared statementfrom a database client, the prepared statement specifying one or morenodes of the database system useable to execute the prepared statement;computer-executable instructions that, when executed by the computingsystem, cause the computing system to update the prepared statement, theupdating comprising adding a node to the one or more nodes in theprepared statement, or removing at least one of the one or more nodes inthe prepared statement, depending on a type of availability statuschange of the replica node; and computer-executable instructions that,when executed by the computing system, cause the computing system to, atthe node, send the updated prepared statement to the database client.22. The one or more computer-readable storage media of claim 21, whereinthe change in status of the replica node comprises the replica nodebecoming unavailable and the computer-executable instructions that causethe computing system to update the prepared statement comprisecomputer-executable instructions that, when executed by the computingsystem, cause the computing system to not include the replica node inthe updated prepared statement.
 23. The one or more computer-readablestorage media of claim 21, wherein the change in status of the replicanode comprises the replica node becoming available and thecomputer-executable instructions that cause the computing system toupdate the prepared statement comprise computer-executable instructionsthat, when executed by the computing system, cause the computing systemto include the replica node in the updated prepared statement.
 24. Theone or more computer-readable storage media of claim 21, furthercomprising: computer-executable instructions that, when executed by thecomputing system, cause the computing system to, at the node, inresponse to determining that the availability status of the replica nodehas changed, increment an identifier maintained by the node;computer-executable instructions that, when executed by the computingsystem, cause the computing system to, at the node, compare theincremented identifier with a version timestamp associated with theprepared statement; and computer-executable instructions that, whenexecuted by the computing system, cause the computing system to, at thenode, determine that the version timestamp identifier is associated withan earlier state of the database system than a state of the databasesystem associated with the incremented identifier; wherein thecomputer-executable instructions that cause the computing system toupdate the prepared statements are executed in response to determiningthat the version timestamp identifier is associated with an earlierstate of the database system.
 25. The one or more computer-readablestorage media of claim 21, wherein the change in status of the replicanode comprises the replica node being unavailable and thecomputer-executable instructions that cause the computing system toupdate the prepared statement comprise computer-executable instructionsthat, when executed by the computing system, cause the computing systemto specify that the prepared statement should be executed at the sourcedatabase system node.
 26. The one or more computer-readable storagemedia of claim 21, wherein the change in status of the replica nodecomprises the replica node being unavailable, the replica node is afirst replica node, and the computer-executable instructions that causethe computing system to update the prepared statement comprisecomputer-executable instructions that, when executed by the computingsystem, cause the computing system to specify that the updated preparedstatement may be executed at the source database system node and atleast a second replica node.
 27. The one or more computer-readablestorage media of claim 21, wherein the computer-executable instructionsthat cause the computing system to determine that the availabilitystatus of the replica node has changed comprise computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the node, determine that a portion of datareplicated at the replica node is not available, a portion of thereplicated data remains available, and the computer-executableinstructions that cause the computing system to update the preparedstatement comprise: computer-executable instructions that, when executedby the computing system, cause the computing system to, at the node,determine data accessed by the prepared statement; computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the node, determine whether data accessed by theprepared statement includes the portion of data replicated at thereplica node that is not available; and computer-executable instructionsthat, when executed by the computing system, cause the computing systemto, at the node, when data accessed by the prepared statement is notavailable at the replica node, not include the replica node in theupdated prepared statement.
 28. The one or more computer-readablestorage media of claim 21, wherein the computer-executable instructionsthat cause the computing system to determine that the availabilitystatus of the replica node has changed comprise computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the node, determine that a portion of datareplicated at the replica node is not available, a portion of thereplicated data remains available, and the computer-executableinstructions that cause the computing system to update the preparedstatement comprise: computer-executable instructions that, when executedby the computing system, cause the computing system to, at the node,determine data accessed by the prepared statement; computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the node, determine whether data accessed by theprepared statement includes the portion of data replicated at thereplica node that is not available; and computer-executable instructionsthat, when executed by the computing system, cause the computing systemto, at the node, when data accessed by the prepared statement isavailable at the replica node, include the replica node in the updatedprepared statement.
 29. The one or more computer-readable storage mediaof claim 21, further comprising: computer-executable instructions that,when executed by the computing system, cause the computing system to, atthe node, update a node status store to indicate the change in status ofthe replica node.
 30. The one or more computer-readable storage media ofclaim 29, wherein the node status store maintains status information forat least a portion of the database system nodes, wherein each node isindicated as active or inactive, and the computer-executableinstructions that cause the computing system to update the preparedstatement comprise computer-executable instructions that, when executedby the computing system, cause the computing system to, at the node,update the prepared statement based on nodes having an active status.31. The one or more computer-readable storage media of claim 21, whereinthe node is the source node, the replica node is a first replica node,and the database system further comprising at least a second replicanode, further comprising: computer-executable instructions that, whenexecuted by the computing system, cause the computing system to, at thesource node, receive a request to commit a database transaction, thedatabase transaction comprising one or more database operations to bereplicated at least at the at least a second replica node;computer-executable instructions that, when executed by the computingsystem, cause the computing system to, at the source node, begin aprocess to commit the database transaction; computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the source node, mark the status of the firstreplica node as inactive; and computer-executable instructions that,when executed by the computing system, cause the computing system to, atthe source node, after marking the status of the first replica node asinactive, commit the transaction.
 32. The one or more computer-readablestorage media of claim 31, further comprising computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the source node, receive a communication fromthe at least a second replica node that the at least a second replicanode marked the first replica node as inactive, wherein the committingoccurs after receiving the communication.
 33. The one or morecomputer-readable storage media of claim 31, further comprising:computer-executable instructions that, when executed by the computingsystem, cause the computing system to, at the source node, increment afirst identifier maintained by the source node; and computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the source node, receive a notification that theat least a second replica node has incremented a second identifier;wherein the first and second identifiers are useable to invalidateprepared statements maintained by the database client and the committingoccurs after the incrementing and receiving the notification.
 34. One ormore computer-readable storage media comprising: computer-executableinstructions that, when executed by a computing system comprising atleast one hardware processor and at least one memory coupled to the atleast one hardware processor, cause the computing system to, at adatabase system client, send a request to a database system node toprepare a statement, the database system node being part of a databasesystem comprising a plurality of database system nodes, at least one ofthe database system nodes being a source node and at least one of thedatabase system nodes being a replica node; computer-executableinstructions that, when executed by the computing system, cause thecomputing system to, at the database system client, receive a preparedstatement from the database system node, the prepared statementspecifying at least one database system node on which the preparedstatement is executable; computer-executable instructions that, whenexecuted by the computing system, cause the computing system to, at thedatabase system client, send the prepared statement to the at least onedatabase system node specified in the prepared statement; andcomputer-executable instructions that, when executed by the computingsystem, cause the computing system to, at the database system client,receive an updated prepared statement, the updated prepared statementspecifying one or more database system nodes on which the updatedprepared statement is executable, the one or more database system nodescomprising a database system node that was not the at least one databasesystem node specified in the prepared statement, or omitting the atleast one database system node specified in the prepared statement. 35.The one or more computer-readable storage media of claim 34, furthercomprising: computer-executable instructions that, when executed by thecomputing system, cause the computing system to, at the database systemclient, send the updated prepared statement to a database system node ofthe one or more database system nodes specified in the updated preparedstatement for execution; and computer-executable instructions that, whenexecuted by the computing system, cause the computing system to, at thedatabase system client, receive execution results.
 36. A method,implemented in a computing system comprising at least one hardwareprocessor and at least one memory coupled to the at least one hardwareprocessor, the method comprising: at a database system node of areplicated database, determining that an availability status of areplica node of a replicated database environment has changed, whereinthe database system node stores at least one database table and thereplicated database environment comprises a plurality of database systemnodes, including the database system node and the replica node, and incommunication with a database client; at the database system node,recording the availability status change in a data store comprisingavailability status information for nodes of the replicated databasesystem; at the database system node, incrementing a metadata identifier;at the database system node, receiving a prepared statement from thedatabase client, the prepared statement associated with a versiontimestamp; at the database system node, comparing the incrementedmetadata identifier with the version timestamp; at the database systemnode, determining that the prepared statement should be updated; at thedatabase system node, updating the prepared statement using theavailability status information of the data store; and at the databasesystem node, sending the updated prepared statement to the databaseclient.
 37. The method of claim 36, wherein determining that anavailability status of a replica node of the replicated databaseenvironment has changed comprises determining at least one replicatedtable that is not accessible at the replica node and recording theavailability status change in the data store comprises recording thatthe at least one replicated table is not available at the replica node.38. The method of claim 37, wherein, after the recording, the data storecomprises at least one replicated table that is accessible at thereplica node.
 39. The method of claim 38, wherein updating the preparedstatement comprises comparing tables accessed by the prepared statementwith accessible tables recorded in the data store.
 40. The method ofclaim 36, the method further comprising: at the database system node,associating the incremented metadata identifier with the updatedprepared statement.